{"id":"https://openalex.org/W3040717777","doi":"https://doi.org/10.1109/tkde.2020.3008128","title":"Graph Matching Via the Lens of Supermodularity","display_name":"Graph Matching Via the Lens of Supermodularity","publication_year":2020,"publication_date":"2020-07-09","ids":{"openalex":"https://openalex.org/W3040717777","doi":"https://doi.org/10.1109/tkde.2020.3008128","mag":"3040717777"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2020.3008128","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2020.3008128","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-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/A5011509788","display_name":"Aritra Konar","orcid":"https://orcid.org/0000-0002-9330-0277"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aritra Konar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA"],"raw_orcid":"https://orcid.org/0000-0002-9330-0277","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA","institution_ids":["https://openalex.org/I51556381"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050186120","display_name":"Nicholas D. Sidiropoulos","orcid":"https://orcid.org/0000-0002-3385-7911"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicholas D. Sidiropoulos","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA"],"raw_orcid":"https://orcid.org/0000-0002-3385-7911","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA, USA","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I51556381"],"apc_list":{"value":2045,"currency":"USD","value_usd":2045},"apc_paid":null,"fwci":0.2601,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.61748875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"5","first_page":"2200","last_page":"2211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5706734657287598},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5314499139785767},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4813702702522278},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46048790216445923},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4286535382270813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3962390422821045},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3962287902832031},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37338727712631226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34588423371315},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.335565984249115}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5706734657287598},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5314499139785767},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4813702702522278},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46048790216445923},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4286535382270813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3962390422821045},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3962287902832031},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37338727712631226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34588423371315},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.335565984249115},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2020.3008128","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2020.3008128","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G8862014259","display_name":"III: Small: A Submodular Framework for Scalable Graph Matching with Performance Guarantees","funder_award_id":"1908070","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1498671329","https://openalex.org/W1571070457","https://openalex.org/W1576820654","https://openalex.org/W1830799964","https://openalex.org/W1973396420","https://openalex.org/W1995907191","https://openalex.org/W2017822917","https://openalex.org/W2019352048","https://openalex.org/W2056124433","https://openalex.org/W2060778826","https://openalex.org/W2068671103","https://openalex.org/W2086058123","https://openalex.org/W2086917808","https://openalex.org/W2102523324","https://openalex.org/W2107427454","https://openalex.org/W2108182844","https://openalex.org/W2108614537","https://openalex.org/W2112090702","https://openalex.org/W2122244345","https://openalex.org/W2122961704","https://openalex.org/W2132013054","https://openalex.org/W2137275576","https://openalex.org/W2139688603","https://openalex.org/W2149037310","https://openalex.org/W2159675343","https://openalex.org/W2168002178","https://openalex.org/W2171214792","https://openalex.org/W2222512263","https://openalex.org/W2312355711","https://openalex.org/W2503629711","https://openalex.org/W2784785544","https://openalex.org/W2952019053","https://openalex.org/W2963701864","https://openalex.org/W2997134027","https://openalex.org/W3003658977","https://openalex.org/W3121235808","https://openalex.org/W3139172074","https://openalex.org/W4231868828","https://openalex.org/W4294620717","https://openalex.org/W6638592267","https://openalex.org/W6687656297","https://openalex.org/W6748430396"],"related_works":["https://openalex.org/W2059407128","https://openalex.org/W2047109035","https://openalex.org/W2047495487","https://openalex.org/W3206302766","https://openalex.org/W4300024640","https://openalex.org/W4287990693","https://openalex.org/W2157523155","https://openalex.org/W2995987536","https://openalex.org/W3201977481","https://openalex.org/W1988896516"],"abstract_inverted_index":{"Graph":[0],"matching,":[1],"the":[2,32,37,58,108,115,130,150,153,158,175,184,188,192],"problem":[3,33,141,159],"of":[4,8,26,41,60,107,114,125,164,187],"aligning":[5],"a":[6,39,71,87,103,123,137,143,162],"pair":[7],"graphs":[9],"so":[10],"as":[11,85],"to":[12,22,93,101,118,160,174,191],"minimize":[13],"their":[14],"edge":[15],"disagreements,":[16],"has":[17],"received":[18],"widespread":[19],"attention":[20],"owing":[21],"its":[23],"broad":[24],"spectrum":[25],"applications":[27],"in":[28,36,142,157],"data":[29,182],"science.":[30],"As":[31],"is":[34,78],"NP\u2013hard":[35],"worst-case,":[38],"variety":[40],"approximation":[42,65],"algorithms":[43],"have":[44],"been":[45],"proposed":[46],"for":[47,67],"obtaining":[48],"high":[49],"quality,":[50],"suboptimal":[51],"solutions.":[52],"In":[53],"this":[54,99],"article,":[55],"we":[56,135],"approach":[57],"task":[59],"designing":[61],"an":[62],"efficient":[63],"polynomial-time":[64],"algorithm":[66,110,151,189],"graph":[68,80],"matching":[69,81,140,177],"from":[70,147],"previously":[72],"unconsidered":[73],"perspective.":[74],"Our":[75],"key":[76],"result":[77],"that":[79],"can":[82],"be":[83],"formulated":[84],"maximizing":[86],"monotone,":[88],"supermodular":[89],"set":[90],"function":[91,117],"subject":[92],"matroid":[94],"intersection":[95],"constraints.":[96,178],"We":[97],"leverage":[98],"fact":[100],"apply":[102],"discrete":[104],"optimization":[105],"variant":[106],"minorization-maximization":[109],"which":[111],"exploits":[112,152],"supermodularity":[113],"objective":[116,169],"iteratively":[119],"construct":[120],"and":[121],"maximize":[122],"sequence":[124,163],"global":[126],"lower":[127],"bounds":[128],"on":[129,180],"objective.":[131],"At":[132],"each":[133],"step,":[134],"solve":[136],"maximum":[138],"weight":[139],"bipartite":[144],"graph.":[145],"Differing":[146],"prior":[148],"approaches,":[149],"combinatorial":[154,176],"structure":[155],"inherent":[156],"generate":[161],"iterates":[165],"featuring":[166],"monotonically":[167],"non-decreasing":[168],"value":[170],"while":[171],"always":[172],"adhering":[173],"Experiments":[179],"real-world":[181],"demonstrate":[183],"empirical":[185],"effectiveness":[186],"relative":[190],"prevailing":[193],"state-of-the-art.":[194]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}