{"id":"https://openalex.org/W3042194019","doi":"https://doi.org/10.1145/3350755.3400248","title":"A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence","display_name":"A Unified Sparsification Approach for Matching Problems in Graphs of Bounded Neighborhood Independence","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W3042194019","doi":"https://doi.org/10.1145/3350755.3400248","mag":"3042194019"},"language":"en","primary_location":{"id":"doi:10.1145/3350755.3400248","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","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/A5054075729","display_name":"Lazar Milenkovi\u0107","orcid":"https://orcid.org/0000-0003-2657-8241"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Lazar Milenkovi\u0107","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084685735","display_name":"Shay Solomon","orcid":"https://orcid.org/0000-0003-2254-5100"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Solomon","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"395","last_page":"406"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T10237","display_name":"Cryptography and Data Security","score":0.9968000054359436,"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/sublinear-function","display_name":"Sublinear function","score":0.7323681116104126},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7085614204406738},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7068475484848022},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6692056655883789},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.643869161605835},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6021205186843872},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5967103838920593},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5124061703681946},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.5025126934051514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49756529927253723},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.48041343688964844},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4510546922683716},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.4425092339515686},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4254192113876343},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3852059543132782},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3766670227050781},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.32239246368408203},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21241545677185059}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7323681116104126},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7085614204406738},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7068475484848022},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6692056655883789},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.643869161605835},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6021205186843872},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5967103838920593},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5124061703681946},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.5025126934051514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49756529927253723},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.48041343688964844},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4510546922683716},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.4425092339515686},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4254192113876343},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3852059543132782},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3766670227050781},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.32239246368408203},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21241545677185059},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3350755.3400248","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7400000095367432,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G8701546242","display_name":null,"funder_award_id":"1991/19","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":90,"referenced_works":["https://openalex.org/W30844683","https://openalex.org/W1505779571","https://openalex.org/W1523755288","https://openalex.org/W1558167226","https://openalex.org/W1568961751","https://openalex.org/W1595640791","https://openalex.org/W1655990431","https://openalex.org/W1964932074","https://openalex.org/W1967311985","https://openalex.org/W1975146994","https://openalex.org/W1980501142","https://openalex.org/W1980675521","https://openalex.org/W1982792741","https://openalex.org/W1983248819","https://openalex.org/W1997707549","https://openalex.org/W2003813631","https://openalex.org/W2011894656","https://openalex.org/W2012711355","https://openalex.org/W2048590231","https://openalex.org/W2051294918","https://openalex.org/W2052811387","https://openalex.org/W2064379477","https://openalex.org/W2069994955","https://openalex.org/W2073705438","https://openalex.org/W2085750496","https://openalex.org/W2092366448","https://openalex.org/W2116953739","https://openalex.org/W2117226423","https://openalex.org/W2133476289","https://openalex.org/W2134167260","https://openalex.org/W2136022810","https://openalex.org/W2145192475","https://openalex.org/W2146343385","https://openalex.org/W2157529519","https://openalex.org/W2161176300","https://openalex.org/W2162656786","https://openalex.org/W2165441947","https://openalex.org/W2261727491","https://openalex.org/W2268832653","https://openalex.org/W2275325805","https://openalex.org/W2294280173","https://openalex.org/W2296210868","https://openalex.org/W2328725012","https://openalex.org/W2333346609","https://openalex.org/W2341465683","https://openalex.org/W2395227458","https://openalex.org/W2542676400","https://openalex.org/W2546514055","https://openalex.org/W2568406555","https://openalex.org/W2619776170","https://openalex.org/W2734687249","https://openalex.org/W2767578875","https://openalex.org/W2782624220","https://openalex.org/W2788015272","https://openalex.org/W2808433750","https://openalex.org/W2809141942","https://openalex.org/W2810304763","https://openalex.org/W2810725631","https://openalex.org/W2885321421","https://openalex.org/W2887981511","https://openalex.org/W2888820341","https://openalex.org/W2899464442","https://openalex.org/W2951592837","https://openalex.org/W2952325666","https://openalex.org/W2952341094","https://openalex.org/W2953253371","https://openalex.org/W2953271509","https://openalex.org/W2962710457","https://openalex.org/W2962906928","https://openalex.org/W2963420932","https://openalex.org/W2963645943","https://openalex.org/W2963998331","https://openalex.org/W2964007887","https://openalex.org/W2968233966","https://openalex.org/W2968883141","https://openalex.org/W2972115413","https://openalex.org/W2972193181","https://openalex.org/W2975721026","https://openalex.org/W2982573470","https://openalex.org/W2983623630","https://openalex.org/W2999929254","https://openalex.org/W3009330671","https://openalex.org/W3035470141","https://openalex.org/W4205300528","https://openalex.org/W4233756358","https://openalex.org/W4235789583","https://openalex.org/W4249294792","https://openalex.org/W4250173201","https://openalex.org/W4252630569","https://openalex.org/W4253069973"],"related_works":["https://openalex.org/W4226049246","https://openalex.org/W2362011785","https://openalex.org/W1587794359","https://openalex.org/W2031276298","https://openalex.org/W3130332934","https://openalex.org/W4361825306","https://openalex.org/W4384388151","https://openalex.org/W4283778727","https://openalex.org/W2898526288","https://openalex.org/W2607123191"],"abstract_inverted_index":{"The":[0,123],"neighborhood":[1,23,30],"independence":[2],"number":[3],"of":[4,16,24,40,53,63,107,125,145],"a":[5,37,79,110,134,138,147],"graph":[6,77],"G,":[7,78],"denoted":[8],"by":[9],"\u03b2":[10],"=":[11],"\u03b2(G),":[12],"is":[13,128],"the":[14,17,22,61,93,104,120,143],"size":[15],"largest":[18],"independent":[19],"set":[20],"in":[21,60,85,92,153],"any":[25,75],"vertex.":[26],"Graphs":[27],"with":[28],"bounded":[29,54],"independence,":[31],"already":[32],"for":[33,74,102],"constant":[34],"\u03b2,":[35,109],"constitute":[36],"wide":[38],"family":[39],"possibly":[41],"dense":[42],"graphs,":[43,46,48],"including":[44],"line":[45],"unit-disk":[47],"claw-free":[49],"graphs":[50,52],"and":[51,69,131,142],"growth,":[55],"which":[56],"has":[57],"been":[58],"well-studied":[59],"area":[62],"distributed":[64],"computing.":[65],"In":[66],"ICALP'19,":[67],"Assadi":[68],"Solomon":[70],"[8]":[71],"showed":[72],"that,":[73,100],"n-vertex":[76],"maximal":[80,111,135],"matching":[81,112,136,149],"can":[82,113,150],"be":[83,114,151],"computed":[84,115,152],"O(n":[86],"log":[87],"n":[88],"\u00b7":[89],"\u03b2)":[90],"time":[91,155],"classic":[94],"sequential":[95,130],"setting.":[96],"This":[97],"result":[98],"shows":[99],"surprisingly,":[101],"almost":[103],"entire":[105,121],"regime":[106],"parameter":[108],"much":[116],"faster":[117],"than":[118],"reading":[119],"input.":[122],"algorithm":[124],"[8],":[126],"however,":[127],"inherently":[129],"centralized.":[132],"Moreover,":[133],"provides":[137],"2-approximate":[139],"(maximum)":[140],"matching,":[141],"question":[144],"whether":[146],"better-than-2-approximate":[148],"sublinear":[154],"remained":[156],"open.":[157]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}