{"id":"https://openalex.org/W2999281610","doi":"https://doi.org/10.1137/17m1163153","title":"Improved Guarantees for Vertex Sparsification in Planar Graphs","display_name":"Improved Guarantees for Vertex Sparsification in Planar Graphs","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2999281610","doi":"https://doi.org/10.1137/17m1163153","mag":"2999281610"},"language":"en","primary_location":{"id":"doi:10.1137/17m1163153","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1163153","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5078315645","display_name":"Gramoz Goranci","orcid":"https://orcid.org/0000-0002-9603-2255"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gramoz Goranci","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Monika Henzinger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101668134","display_name":"Pan Peng","orcid":"https://orcid.org/0000-0003-2700-5699"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pan Peng","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-2700-5699","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1655,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.82906923,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"34","issue":"1","first_page":"130","last_page":"162"},"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.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944000244140625,"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/reachability","display_name":"Reachability","score":0.8118048310279846},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8026612997055054},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7804703712463379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6538434028625488},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6150505542755127},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6035749912261963},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5624328255653381},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4629339575767517},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4530170261859894},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.44016233086586},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43766435980796814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4287194013595581},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1872551441192627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1151997447013855}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8118048310279846},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8026612997055054},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7804703712463379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6538434028625488},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6150505542755127},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6035749912261963},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5624328255653381},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4629339575767517},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4530170261859894},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.44016233086586},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43766435980796814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4287194013595581},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1872551441192627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1151997447013855},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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.1137/17m1163153","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1163153","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7572345283","display_name":null,"funder_award_id":"340506","funder_id":"https://openalex.org/F4320333065","funder_display_name":"Seventh Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320333065","display_name":"Seventh Framework Programme","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1968729061","https://openalex.org/W1969823477","https://openalex.org/W1989650529","https://openalex.org/W2006382572","https://openalex.org/W2017713020","https://openalex.org/W2024972568","https://openalex.org/W2027697499","https://openalex.org/W2031536548","https://openalex.org/W2031769269","https://openalex.org/W2032684479","https://openalex.org/W2039305125","https://openalex.org/W2044422580","https://openalex.org/W2045446569","https://openalex.org/W2068727899","https://openalex.org/W2082538734","https://openalex.org/W2087806988","https://openalex.org/W2092534058","https://openalex.org/W2096304547","https://openalex.org/W2110920860","https://openalex.org/W2118382442","https://openalex.org/W2129575457","https://openalex.org/W2569472613","https://openalex.org/W2725976336","https://openalex.org/W2963845569","https://openalex.org/W2971548643","https://openalex.org/W3100089996","https://openalex.org/W3160409744"],"related_works":["https://openalex.org/W2764121385","https://openalex.org/W2188648465","https://openalex.org/W3038069570","https://openalex.org/W3018984900","https://openalex.org/W4287184894","https://openalex.org/W2006485460","https://openalex.org/W2057787145","https://openalex.org/W2549740858","https://openalex.org/W3104828215","https://openalex.org/W2012799621"],"abstract_inverted_index":{"Graph":[0],"sparsification":[1],"aims":[2],"at":[3],"compressing":[4],"large":[5],"graphs":[6,201],"into":[7],"smaller":[8],"ones":[9],"while":[10],"preserving":[11],"important":[12],"characteristics":[13],"of":[14,34,61,83,92,104,116,127,147,175,189,195,216,237,256],"the":[15,32,39,81,90,125,187,204,209,233],"input":[16],"graph.":[17],"In":[18,85],"this":[19,86,254],"work":[20,87],"we":[21,88,97],"study":[22],"vertex":[23],"sparsifiers,":[24],"i.e.,":[25,96],"sparsifiers":[26,215,243],"whose":[27],"goal":[28],"is":[29,63,122,177],"to":[30,100,130,226],"reduce":[31],"number":[33],"vertices.":[35,156],"We":[36,106,134,197],"focus":[37],"on":[38,208],"following":[40],"notions:":[41],"(1)":[42],"Given":[43,158],"a":[44,57,64,102,159,178],"digraph":[45,65],"$G=(V,E)$":[46,163],"and":[47,119,164,228,241,248],"terminal":[48,76,165],"vertices":[49,166],"$K":[50,67,182],"\\subset":[51,68,183],"V$":[52],"with":[53,168,181,202],"$|K|":[54],"=":[55],"k$,":[56],"(vertex)":[58,172],"reachability":[59,73],"sparsifier":[60,174],"$G$":[62,111,121,176],"$H=(V_H,E_H)$,":[66],"V_H$":[69,184],"that":[70,141,150,185,199,219],"preserves":[71,186],"all":[72,203],"information":[74],"among":[75],"pairs.":[77],"Let":[78],"$|V_H|$":[79],"denote":[80],"size":[82,117,126,217],"$H$.":[84],"introduce":[89],"notion":[91],"reachability-preserving":[93],"minors":[94],"(RPMs),":[95],"require":[98],"$H$":[99,115,128,180],"be":[101],"minor":[103],"$G$.":[105],"show":[107,198],"any":[108,151,193],"directed":[109],"graph":[110,162,179],"admits":[112],"an":[113,144,170,245,250],"RPM":[114,152],"$O(k^3)$,":[118],"if":[120],"planar,":[123],"then":[124],"improves":[129,232],"$O(k^{2}":[131],"\\log":[132],"k)$.":[133],"complement":[135],"our":[136],"upper":[137],"bound":[138,236],"by":[139,244],"showing":[140],"there":[142],"exists":[143],"infinite":[145],"family":[146],"grids":[148],"such":[149],"must":[153],"have":[154],"$\\Omega(k^{2})$":[155],"(2)":[157],"weighted":[160],"undirected":[161],"$K$":[167],"$|K|=k$,":[169],"exact":[171,213],"cut":[173,214,240],"value":[188],"minimum":[190],"cuts":[191],"separating":[192],"bipartition":[194],"$K$.":[196],"planar":[200],"$k$":[205],"terminals":[206],"lying":[207],"same":[210],"face":[211],"admit":[212],"$O(k^{2})$":[218],"are":[220],"also":[221],"planar.":[222],"Our":[223],"result":[224],"extends":[225],"flow":[227,242],"distance":[229],"sparsifiers.":[230],"It":[231],"previous":[234],"best-known":[235],"$O(k^22^{2k})$":[238],"for":[239,253],"exponential":[246],"factor":[247],"matches":[249],"$\\Omega(k^2)$":[251],"lower-bound":[252],"class":[255],"graphs.":[257]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}