{"id":"https://openalex.org/W2111157038","doi":"https://doi.org/10.1109/icpr.2002.1047427","title":"A new algorithm for inexact graph matching","display_name":"A new algorithm for inexact graph matching","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2111157038","doi":"https://doi.org/10.1109/icpr.2002.1047427","mag":"2111157038"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2002.1047427","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2002.1047427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Object recognition supported by user interaction for service robots","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036028258","display_name":"Adel Hlaoui","orcid":null},"institutions":[{"id":"https://openalex.org/I135117807","display_name":"Universit\u00e9 de Sherbrooke","ror":"https://ror.org/00kybxq39","country_code":"CA","type":"education","lineage":["https://openalex.org/I135117807"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"A. Hlaoui","raw_affiliation_strings":["Facult\u00e9 des Sciences/ DMI,DMI, Universit\u00e9 de Sherbrooke, Sherbrooke, QUE, Canada","Faculte des Sci., Sherbrooke Univ., Que., Canada"],"affiliations":[{"raw_affiliation_string":"Facult\u00e9 des Sciences/ DMI,DMI, Universit\u00e9 de Sherbrooke, Sherbrooke, QUE, Canada","institution_ids":["https://openalex.org/I135117807"]},{"raw_affiliation_string":"Faculte des Sci., Sherbrooke Univ., Que., Canada","institution_ids":["https://openalex.org/I135117807"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065104101","display_name":"Shengrui Wang","orcid":"https://orcid.org/0000-0001-6863-7022"},"institutions":[{"id":"https://openalex.org/I135117807","display_name":"Universit\u00e9 de Sherbrooke","ror":"https://ror.org/00kybxq39","country_code":"CA","type":"education","lineage":["https://openalex.org/I135117807"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Shengrui Wang","raw_affiliation_strings":["Facult\u00e9 des Sciences / DMI,DMI, Universit\u00e9 de Sherbrooke, Sherbrooke, QUE, Canada","Faculte des Sci., Sherbrooke Univ., Que., Canada"],"affiliations":[{"raw_affiliation_string":"Facult\u00e9 des Sciences / DMI,DMI, Universit\u00e9 de Sherbrooke, Sherbrooke, QUE, Canada","institution_ids":["https://openalex.org/I135117807"]},{"raw_affiliation_string":"Faculte des Sci., Sherbrooke Univ., Que., Canada","institution_ids":["https://openalex.org/I135117807"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036028258"],"corresponding_institution_ids":["https://openalex.org/I135117807"],"apc_list":null,"apc_paid":null,"fwci":5.6564,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.9642242,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4","issue":null,"first_page":"180","last_page":"183"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.7168976664543152},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6261851191520691},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.6154345870018005},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.5865459442138672},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5277308225631714},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5122749209403992},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5043295621871948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5020074844360352},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4608757793903351},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4309282898902893},{"id":"https://openalex.org/keywords/optimal-matching","display_name":"Optimal matching","score":0.4284396171569824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38157665729522705},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3375561833381653},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31882327795028687},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1218307614326477}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7168976664543152},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6261851191520691},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.6154345870018005},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.5865459442138672},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5277308225631714},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5122749209403992},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5043295621871948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5020074844360352},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4608757793903351},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4309282898902893},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.4284396171569824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38157665729522705},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3375561833381653},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31882327795028687},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1218307614326477},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icpr.2002.1047427","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2002.1047427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Object recognition supported by user interaction for service robots","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.90.6797","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.6797","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dmi.usherb.ca/~wang/publications/confs/2002/icpr2002.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1977866540","https://openalex.org/W2010541316","https://openalex.org/W2126359798","https://openalex.org/W2162551958"],"related_works":["https://openalex.org/W2953496651","https://openalex.org/W2393701947","https://openalex.org/W2886672068","https://openalex.org/W3208942821","https://openalex.org/W167435155","https://openalex.org/W4285101991","https://openalex.org/W4324266426","https://openalex.org/W2789630860","https://openalex.org/W1544562508","https://openalex.org/W2111157038"],"abstract_inverted_index":{"The":[0,54,87,119],"graph":[1,22,25],"is":[2,27,42,121],"an":[3],"essential":[4],"data":[5],"structure":[6],"for":[7,49],"representing":[8],"relational":[9],"information.":[10],"When":[11],"graphs":[12,38,83],"are":[13],"used":[14],"to":[15,21,72,84],"represent":[16],"objects,":[17],"comparing":[18],"objects":[19],"amounts":[20],"matching.":[23],"Inexact":[24],"matching":[26,35,41,52,59],"the":[28,32,50,58,65,73,76,81,90,95,104,124],"process":[29,60],"of":[30,67,75,78,89,97,100,114],"finding":[31],"best":[33],"possible":[34],"between":[36,117],"two":[37,82],"when":[39],"exact":[40],"impossible.":[43],"We":[44],"propose":[45],"a":[46],"new":[47,55,91],"algorithm":[48,56,92,120,128],"inexact":[51],"problem.":[53],"decomposes":[57],"into":[61],"K":[62,68],"phases,":[63],"where":[64],"value":[66],"ranges":[69],"from":[70,94],"1":[71],"minimum":[74],"numbers":[77],"nodes":[79],"in":[80],"be":[85],"matched.":[86],"efficiency":[88],"results":[93],"use":[96],"small":[98],"values":[99],"K,":[101],"significantly":[102],"reducing":[103],"search":[105],"space":[106],"while":[107],"still":[108],"producing":[109],"very":[110],"good":[111],"matchings":[112],"(most":[113],"them":[115],"optimal)":[116],"graphs.":[118],"compared":[122],"with":[123],"error-correcting":[125],"subgraph":[126],"isomorphism":[127],"based":[129],"on":[130],"A*.":[131]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}