{"id":"https://openalex.org/W4226193467","doi":"https://doi.org/10.1109/isit50566.2022.9834398","title":"On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment","display_name":"On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4226193467","doi":"https://doi.org/10.1109/isit50566.2022.9834398"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834398","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834398","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"2022 IEEE International Symposium on Information Theory (ISIT)","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/A5029597988","display_name":"Ziao Wang","orcid":"https://orcid.org/0000-0002-1879-6559"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Ziao Wang","raw_affiliation_strings":["University of British Columbia,Vancouver,BC,Canada,V6T1Z4"],"affiliations":[{"raw_affiliation_string":"University of British Columbia,Vancouver,BC,Canada,V6T1Z4","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100404886","display_name":"Ning Zhang","orcid":"https://orcid.org/0000-0002-8781-4925"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ning Zhang","raw_affiliation_strings":["University of British Columbia,Vancouver,BC,Canada,V6T1Z4"],"affiliations":[{"raw_affiliation_string":"University of British Columbia,Vancouver,BC,Canada,V6T1Z4","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100646894","display_name":"Weina Wang","orcid":"https://orcid.org/0000-0001-6808-0156"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Weina Wang","raw_affiliation_strings":["Carnegie Mellon University,Pittsburgh,PA,USA,15213"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Pittsburgh,PA,USA,15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100383688","display_name":"Lele Wang","orcid":"https://orcid.org/0000-0002-4077-433X"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Lele Wang","raw_affiliation_strings":["University of British Columbia,Vancouver,BC,Canada,V6T1Z4"],"affiliations":[{"raw_affiliation_string":"University of British Columbia,Vancouver,BC,Canada,V6T1Z4","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029597988"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":null,"apc_paid":null,"fwci":0.1046,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24847618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1163","last_page":"1168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9983000159263611,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9983000159263611,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9980000257492065,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.6400399804115295},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.552950382232666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5520263314247131},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5379557609558105},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4304355978965759},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42175740003585815}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6400399804115295},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.552950382232666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5520263314247131},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5379557609558105},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4304355978965759},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42175740003585815}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834398","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834398","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W2044490483","https://openalex.org/W2222512263","https://openalex.org/W2391555403","https://openalex.org/W2891773754","https://openalex.org/W2963551335","https://openalex.org/W3034690324","https://openalex.org/W3038743309","https://openalex.org/W3088419579","https://openalex.org/W3156017714","https://openalex.org/W3198437605","https://openalex.org/W3198440786","https://openalex.org/W3205358994","https://openalex.org/W4226193467","https://openalex.org/W4251349825","https://openalex.org/W4251358674","https://openalex.org/W6755814372","https://openalex.org/W6779862254","https://openalex.org/W6802816873"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542"],"abstract_inverted_index":{"Graph":[0],"alignment":[1,28,54,118,132],"aims":[2],"at":[3],"finding":[4],"the":[5,91,101,109,115,120,125],"vertex":[6,92],"correspondence":[7,93],"between":[8],"two":[9,85],"correlated":[10],"graphs,":[11],"a":[12,30],"task":[13],"that":[14,88],"frequently":[15],"occurs":[16],"in":[17,35],"graph":[18,27,33,47,53,117],"mining":[19],"applications":[20],"such":[21],"as":[22],"social":[23],"network":[24],"analysis.":[25],"Attributed":[26],"is":[29,104],"variant":[31],"of":[32,66,100],"alignment,":[34],"which":[36],"publicly":[37],"available":[38],"side":[39],"information":[40],"or":[41,63],"attributes":[42],"are":[43],"exploited":[44],"to":[45,72,108,114],"assist":[46],"alignment.":[48],"Existing":[49],"studies":[50],"on":[51,56],"attributed":[52],"focus":[55],"either":[57],"theoretical":[58,77],"performance":[59,65,78],"without":[60],"computational":[61],"constraints":[62],"empirical":[64],"efficient":[67,74],"algorithms.":[68,135],"This":[69],"motivates":[70],"us":[71],"investigate":[73],"algorithms":[75,87,103,122],"with":[76,94],"guarantee.":[79],"In":[80],"this":[81],"paper,":[82],"we":[83],"propose":[84],"polynomial-time":[86,134],"exactly":[89],"recover":[90],"high":[95],"probability.":[96],"The":[97],"feasible":[98,128],"region":[99,129],"proposed":[102,121],"near":[105],"optimal":[106],"compared":[107],"information-theoretic":[110],"limits.":[111],"When":[112],"specialized":[113],"seeded":[116],"problem,":[119],"strictly":[123],"improve":[124],"best":[126],"known":[127],"for":[130],"exact":[131],"by":[133]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}