{"id":"https://openalex.org/W1564386177","doi":"https://doi.org/10.1109/icarcv.2002.1238511","title":"A novel isomorphism based on nearest neighbours for efficient graph matching algorithm","display_name":"A novel isomorphism based on nearest neighbours for efficient graph matching algorithm","publication_year":2004,"publication_date":"2004-03-23","ids":{"openalex":"https://openalex.org/W1564386177","doi":"https://doi.org/10.1109/icarcv.2002.1238511","mag":"1564386177"},"language":"en","primary_location":{"id":"doi:10.1109/icarcv.2002.1238511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icarcv.2002.1238511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Conference on Control, Automation, Robotics and Vision, 2002. ICARCV 2002.","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/A5046031344","display_name":"D.A.L. Piriyakumar","orcid":"https://orcid.org/0000-0002-4303-8573"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D.A.L. Piriyakumar","raw_affiliation_strings":["IPVS. Depertment of computer science, University of stuttgart, Germany","Dept. of Comput. Sci., Stuttgart Univ., Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IPVS. Depertment of computer science, University of stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Stuttgart Univ., Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111539971","display_name":"Paul Levi","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"P. Levi","raw_affiliation_strings":["IPVS. Depertment of computer science, University of stuttgart, Germany","Dept. of Comput. Sci., Stuttgart Univ., Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IPVS. Depertment of computer science, University of stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Stuttgart Univ., Germany","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100066346"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.06992109,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"722","last_page":"727"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":1.0,"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":1.0,"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/T11106","display_name":"Data Management and Algorithms","score":0.9943000078201294,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6317369937896729},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6300785541534424},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5473476052284241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5470302104949951},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.4898504912853241},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4828343987464905},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4813854992389679},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.43945297598838806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37483519315719604},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35474932193756104},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31938713788986206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3014935851097107},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13505449891090393}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6317369937896729},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6300785541534424},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5473476052284241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5470302104949951},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.4898504912853241},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4828343987464905},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4813854992389679},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.43945297598838806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37483519315719604},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35474932193756104},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31938713788986206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3014935851097107},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13505449891090393},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"score":0.0},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icarcv.2002.1238511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icarcv.2002.1238511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Conference on Control, Automation, Robotics and Vision, 2002. ICARCV 2002.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W9419878","https://openalex.org/W1655990431","https://openalex.org/W2035143052","https://openalex.org/W2095052098","https://openalex.org/W2108182844","https://openalex.org/W2122929441","https://openalex.org/W2123690485","https://openalex.org/W2126359798","https://openalex.org/W2136761100","https://openalex.org/W2144931885","https://openalex.org/W2152132697","https://openalex.org/W2154878346","https://openalex.org/W2159537329","https://openalex.org/W2162551958","https://openalex.org/W6637190722"],"related_works":["https://openalex.org/W1482551403","https://openalex.org/W84561889","https://openalex.org/W1258892498","https://openalex.org/W2905073546","https://openalex.org/W3080158623","https://openalex.org/W1856194915","https://openalex.org/W2494517118","https://openalex.org/W2183579781","https://openalex.org/W2221885959","https://openalex.org/W2046021036"],"abstract_inverted_index":{"For":[0],"many":[1],"applications":[2],"in":[3,22,35,45,65,98,108],"the":[4,17,23,32,43,46,54,69,104,110,121,124,134,137,151,181,184,187,202,207],"fields":[5,40],"of":[6,71,106,123,131,153,166,180,186],"robotics,":[7],"satellite":[8],"imagery":[9],"and":[10,116,164,169,178,200],"medical":[11],"imaging":[12],"demanding":[13],"real-time":[14,72],"solutions,":[15,73],"recognizing":[16],"crucial":[18,167],"parts":[19],"or":[20],"structures":[21],"given":[24],"images":[25],"continues":[26],"to":[27,52],"attract":[28],"more":[29],"attention.":[30],"Tims,":[31],"paramount":[33],"factor":[34],"these":[36],"computer":[37],"vision":[38],"related":[39],"is":[41,57,62,91,103,158,195],"matching":[42,61,132,154,206],"objects":[44],"images.":[47],"Often":[48],"graphs":[49,97,111,125,171],"are":[50,79,126,142,172],"used":[51],"represent":[53],"objects.":[55],"It":[56],"well-known":[58],"that":[59],"graph":[60],"NT-complete":[63],"problem":[64],"general.":[66],"To":[67],"accomplish":[68],"need":[70],"various":[74],"lower":[75],"order":[76],"complexity":[77],"algorithms":[78],"developed":[80],"with":[81,197],"specific":[82],"conditions.":[83],"Here,":[84],"a":[85],"novel":[86],"Node":[87],"Neighbour":[88],"Isomorphism":[89],"(NNI)":[90],"introduced":[92],"which":[93,112,189],"efficiently":[94],"matches":[95],"two":[96],"O(n/sup":[99],"4/)":[100],"where":[101],"n":[102],"number":[105,152],"vertices":[107,122,140],"both":[109],"can":[113],"be":[114],"weighted":[115],"attributed.":[117],"Using":[118],"tliis":[119],"NNI,":[120],"grouped":[127],"mutually":[128],"exclusively.":[129],"Instead":[130],"all":[133],"vertices,":[135],"only":[136],"relevant":[138],"NNI":[139],"alone":[141],"matched":[143],"paving":[144],"way":[145],"for":[146,205],"ample":[147],"efficiency":[148,185],"by":[149],"reducing":[150],"operations.":[155],"The":[156,175,193],"algorithm":[157,182,188,194],"implemented":[159],"on":[160],"Sun":[161],"Ultra":[162],"10":[163],"results":[165],"examples":[168],"random":[170],"also":[173,190],"tabled.":[174],"run-time":[176],"performance":[177],"novality":[179],"exemplifies":[183],"exhibits":[191],"parallelism.":[192],"compared":[196],"standard":[198],"methods":[199],"requires":[201],"minimal":[203],"time":[204],"graphs.":[208]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}