{"id":"https://openalex.org/W4242260020","doi":"https://doi.org/10.1109/icpr.2004.1334549","title":"Graph matching using random walks","display_name":"Graph matching using random walks","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4242260020","doi":"https://doi.org/10.1109/icpr.2004.1334549"},"language":"en","primary_location":{"id":"doi:10.1109/icpr.2004.1334549","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2004.1334549","pdf_url":null,"source":{"id":"https://openalex.org/S4363608750","display_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5022658803","display_name":"Marco Gori","orcid":"https://orcid.org/0000-0001-6337-5430"},"institutions":[{"id":"https://openalex.org/I102064193","display_name":"University of Siena","ror":"https://ror.org/01tevnk56","country_code":"IT","type":"education","lineage":["https://openalex.org/I102064193"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Gori","raw_affiliation_strings":["DII, Univ. degli Studi di Siena, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DII, Univ. degli Studi di Siena, Italy","institution_ids":["https://openalex.org/I102064193"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080411641","display_name":"Marco Maggini","orcid":"https://orcid.org/0000-0002-6428-1265"},"institutions":[{"id":"https://openalex.org/I102064193","display_name":"University of Siena","ror":"https://ror.org/01tevnk56","country_code":"IT","type":"education","lineage":["https://openalex.org/I102064193"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Maggini","raw_affiliation_strings":["DII, Univ. degli Studi di Siena, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DII, Univ. degli Studi di Siena, Italy","institution_ids":["https://openalex.org/I102064193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025829520","display_name":"Lorenzo Sarti","orcid":null},"institutions":[{"id":"https://openalex.org/I102064193","display_name":"University of Siena","ror":"https://ror.org/01tevnk56","country_code":"IT","type":"education","lineage":["https://openalex.org/I102064193"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L. Sarti","raw_affiliation_strings":["DII, Univ. degli Studi di Siena, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DII, Univ. degli Studi di Siena, Italy","institution_ids":["https://openalex.org/I102064193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102064193"],"apc_list":null,"apc_paid":null,"fwci":2.8538,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.92251816,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"394","last_page":"397 Vol.3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9958000183105469,"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/T11478","display_name":"Caching and Content Delivery","score":0.9940000176429749,"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.6297621130943298},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6160081624984741},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.5931580066680908},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5587596893310547},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5329611897468567},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5081131458282471},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4788389205932617},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4784674346446991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46457940340042114},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.446572482585907},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4356396198272705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2970874309539795}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6297621130943298},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6160081624984741},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.5931580066680908},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5587596893310547},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5329611897468567},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5081131458282471},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4788389205932617},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4784674346446991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46457940340042114},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.446572482585907},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4356396198272705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2970874309539795},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icpr.2004.1334549","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpr.2004.1334549","pdf_url":null,"source":{"id":"https://openalex.org/S4363608750","display_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:usiena-air.unisi.it:11365/36678","is_oa":false,"landing_page_url":"http://hdl.handle.net/11365/36678","pdf_url":null,"source":{"id":"https://openalex.org/S4377196319","display_name":"Use Siena air (University of Siena)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102064193","host_organization_name":"University of Siena","host_organization_lineage":["https://openalex.org/I102064193"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W128561509","https://openalex.org/W1910918478","https://openalex.org/W2005047225","https://openalex.org/W2066636486","https://openalex.org/W2095052098","https://openalex.org/W2126359798","https://openalex.org/W2136761100","https://openalex.org/W3106926726","https://openalex.org/W6605247924","https://openalex.org/W6786113189"],"related_works":["https://openalex.org/W1597743604","https://openalex.org/W2038723108","https://openalex.org/W2033630974","https://openalex.org/W4245069437","https://openalex.org/W2325737604","https://openalex.org/W4297449606","https://openalex.org/W2382333285","https://openalex.org/W2076621518","https://openalex.org/W2170725231","https://openalex.org/W122605929"],"abstract_inverted_index":{"In":[0,90],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,70],"graph":[6,101],"matching":[7],"algorithm":[8,34,94],"which":[9],"uses":[10],"random":[11],"walks":[12],"to":[13,22,43,59,86],"compute":[14],"topological":[15,40],"features":[16,41],"for":[17,64],"each":[18],"node,":[19],"in":[20,29,97],"order":[21],"identify":[23],"candidate":[24],"pairs":[25],"of":[26,39,80,100],"corresponding":[27],"nodes":[28],"the":[30,37,45,49,53,67,81,87,92,98],"two":[31],"graphs.":[32],"The":[33],"automatically":[35],"adapts":[36],"number":[38,99],"required":[42],"determine":[44],"exact":[46,62],"match":[47],"among":[48],"nodes.":[50,102],"Even":[51],"if":[52],"proposed":[54,93],"technique":[55],"is":[56,95],"not":[57],"guaranteed":[58],"provide":[60],"an":[61],"solution":[63],"all":[65],"graphs,":[66],"experiments":[68],"on":[69],"benchmark":[71],"dataset":[72],"show":[73],"that":[74],"it":[75],"can":[76],"outperform":[77],"other":[78],"state":[79],"art":[82],"algorithms":[83],"with":[84],"respect":[85],"computational":[88],"requirements.":[89],"fact,":[91],"polynomial":[96]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}