{"id":"https://openalex.org/W2272191051","doi":"https://doi.org/10.1007/s41095-015-0030-4","title":"Inexact graph matching using a hierarchy of matching processes","display_name":"Inexact graph matching using a hierarchy of matching processes","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2272191051","doi":"https://doi.org/10.1007/s41095-015-0030-4","mag":"2272191051"},"language":"en","primary_location":{"id":"doi:10.1007/s41095-015-0030-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41095-015-0030-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s41095-015-0030-4.pdf","source":{"id":"https://openalex.org/S2487656537","display_name":"Computational Visual Media","issn_l":"2096-0433","issn":["2096-0433","2096-0662"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Visual Media","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://link.springer.com/content/pdf/10.1007/s41095-015-0030-4.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030432086","display_name":"Paul Morrison","orcid":"https://orcid.org/0000-0002-3389-8393"},"institutions":[{"id":"https://openalex.org/I63525965","display_name":"Western Sydney University","ror":"https://ror.org/03t52dk35","country_code":"AU","type":"education","lineage":["https://openalex.org/I63525965"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Paul Morrison","raw_affiliation_strings":["School of Computing, Engineering and Mathematics, Western Sydney University, Locked Bag 1797, Penrith, NSW 2751, Australia","School of Computing, Engineering and Mathematics, Western Sydney University, Locked Bag 1797, Penrith, NSW, 2751, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Engineering and Mathematics, Western Sydney University, Locked Bag 1797, Penrith, NSW 2751, Australia","institution_ids":["https://openalex.org/I63525965"]},{"raw_affiliation_string":"School of Computing, Engineering and Mathematics, Western Sydney University, Locked Bag 1797, Penrith, NSW, 2751, Australia","institution_ids":["https://openalex.org/I63525965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040512740","display_name":"Ju Jia Zou","orcid":"https://orcid.org/0000-0001-5091-7309"},"institutions":[{"id":"https://openalex.org/I63525965","display_name":"Western Sydney University","ror":"https://ror.org/03t52dk35","country_code":"AU","type":"education","lineage":["https://openalex.org/I63525965"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ju Jia Zou","raw_affiliation_strings":["School of Computing, Engineering and Mathematics, Western Sydney University, Locked Bag 1797, Penrith, NSW 2751, Australia","School of Computing, Engineering and Mathematics, Western Sydney University, Locked Bag 1797, Penrith, NSW, 2751, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Engineering and Mathematics, Western Sydney University, Locked Bag 1797, Penrith, NSW 2751, Australia","institution_ids":["https://openalex.org/I63525965"]},{"raw_affiliation_string":"School of Computing, Engineering and Mathematics, Western Sydney University, Locked Bag 1797, Penrith, NSW, 2751, Australia","institution_ids":["https://openalex.org/I63525965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7488,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.80216913,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"1","issue":"4","first_page":"291","last_page":"307"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/heuristics","display_name":"Heuristics","score":0.6652247309684753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6232734322547913},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5803413391113281},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.559895932674408},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5004572868347168},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49051064252853394},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4623910188674927},{"id":"https://openalex.org/keywords/optimal-matching","display_name":"Optimal matching","score":0.4587768018245697},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.45573315024375916},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44786375761032104},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4170393943786621},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38081449270248413},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2883802056312561}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6652247309684753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6232734322547913},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5803413391113281},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.559895932674408},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5004572868347168},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49051064252853394},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4623910188674927},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.4587768018245697},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.45573315024375916},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44786375761032104},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4170393943786621},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38081449270248413},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2883802056312561},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s41095-015-0030-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41095-015-0030-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s41095-015-0030-4.pdf","source":{"id":"https://openalex.org/S2487656537","display_name":"Computational Visual Media","issn_l":"2096-0433","issn":["2096-0433","2096-0662"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Visual Media","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s41095-015-0030-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s41095-015-0030-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s41095-015-0030-4.pdf","source":{"id":"https://openalex.org/S2487656537","display_name":"Computational Visual Media","issn_l":"2096-0433","issn":["2096-0433","2096-0662"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Visual Media","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320966","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2272191051.pdf","grobid_xml":"https://content.openalex.org/works/W2272191051.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W154498758","https://openalex.org/W1488970853","https://openalex.org/W1537645835","https://openalex.org/W1593916827","https://openalex.org/W1971067901","https://openalex.org/W1972984694","https://openalex.org/W1976466396","https://openalex.org/W1977866540","https://openalex.org/W2003627696","https://openalex.org/W2013563330","https://openalex.org/W2014430206","https://openalex.org/W2045527716","https://openalex.org/W2092143568","https://openalex.org/W2108611942","https://openalex.org/W2109294083","https://openalex.org/W2111569598","https://openalex.org/W2122410182","https://openalex.org/W2127390687","https://openalex.org/W2136761100","https://openalex.org/W2137913010","https://openalex.org/W2155235203","https://openalex.org/W2159537329","https://openalex.org/W2160645305","https://openalex.org/W2505843704","https://openalex.org/W2803428193","https://openalex.org/W2913012475"],"related_works":["https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2367674792","https://openalex.org/W2184969544","https://openalex.org/W1519280321","https://openalex.org/W3133897873","https://openalex.org/W2366714142","https://openalex.org/W2054458431","https://openalex.org/W2074449235","https://openalex.org/W2358102224"],"abstract_inverted_index":{"Inexact":[0,21],"graph":[1,22,79,162],"matching":[2,23,80,100,112,118,174],"algorithms":[3],"have":[4],"proved":[5],"to":[6,72,192],"be":[7,62,190],"useful":[8],"in":[9,120,145,171],"many":[10,50],"applications,":[11],"such":[12],"as":[13],"character":[14],"recognition,":[15],"shape":[16,183],"analysis,":[17],"and":[18,102,176],"image":[19],"analysis.":[20],"is,":[24],"however,":[25],"inherently":[26],"an":[27,58,85,126],"NP-hard":[28],"problem":[29,44,139],"with":[30],"exponential":[31],"computational":[32],"complexity.":[33],"Much":[34],"of":[35,51,68,76,111,116,173,182],"the":[36,66,69,74,77,121,132,151,180],"previous":[37],"research":[38],"has":[39,140],"focused":[40],"on":[41,161],"solving":[42],"this":[43,138,146],"using":[45],"heuristics":[46],"or":[47],"estimations.":[48],"Unfortunately,":[49],"these":[52],"techniques":[53],"do":[54],"not":[55],"guarantee":[56],"that":[57,129,150],"optimal":[59,86],"solution":[60,87,196],"will":[61],"found.":[63],"It":[64],"is":[65,93,123,154],"aim":[67],"proposed":[70,152,166,186],"algorithm":[71,153,167,187],"reduce":[73],"complexity":[75],"inexact":[78],"process,":[81,101],"while":[82],"still":[83],"producing":[84,108],"for":[88,104,179],"a":[89,109,194],"known":[90],"application.":[91],"This":[92],"achieved":[94],"by":[95,107,125],"greatly":[96],"simplifying":[97],"each":[98,117],"individual":[99],"compensating":[103],"lost":[105],"robustness":[106],"hierarchy":[110,122],"processes.":[113],"The":[114,165,185],"creation":[115],"process":[119],"driven":[124],"application-specific":[127],"criterion":[128],"operates":[130],"at":[131],"subgraph":[133],"scale.":[134],"To":[135],"our":[136],"knowledge,":[137],"never":[141],"before":[142],"been":[143],"approached":[144],"manner.":[147],"Results":[148],"show":[149],"faster":[155],"than":[156],"two":[157],"existing":[158],"methods":[159],"based":[160],"edit":[163],"operations.":[164],"produces":[168],"accurate":[169],"results":[170],"terms":[172],"graphs,":[175],"shows":[177],"promise":[178],"application":[181],"matching.":[184],"can":[188],"easily":[189],"extended":[191],"produce":[193],"sub-optimal":[195],"if":[197],"required.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-06-14T07:44:22.658603","created_date":"2025-10-10T00:00:00"}