{"id":"https://openalex.org/W2958706771","doi":"https://doi.org/10.1137/16m1091666","title":"A General Framework for Graph Sparsification","display_name":"A General Framework for Graph Sparsification","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2958706771","doi":"https://doi.org/10.1137/16m1091666","mag":"2958706771"},"language":"en","primary_location":{"id":"doi:10.1137/16m1091666","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1091666","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5109430666","display_name":"Wai-Shing Fung","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wai-Shing Fung","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103368959","display_name":"Ramesh Hariharan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramesh Hariharan","raw_affiliation_strings":["Life Sciences"],"affiliations":[{"raw_affiliation_string":"Life Sciences","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102957872","display_name":"Nicholas J. A. Harvey","orcid":"https://orcid.org/0000-0001-5593-9785"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicholas J. A. Harvey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["CSAIL, MIT"],"affiliations":[{"raw_affiliation_string":"CSAIL, MIT","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5109430666"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6556,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.95308832,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"48","issue":"4","first_page":"1196","last_page":"1223"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9973000288009644,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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/multiplicative-function","display_name":"Multiplicative function","score":0.790867805480957},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.6480705738067627},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6429377198219299},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5109540820121765},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5088415741920471},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4811219274997711},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4642333388328552},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44843146204948425},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44212013483047485},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.42476987838745117},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4133976101875305},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3365561068058014},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22331419587135315},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06643733382225037}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.790867805480957},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.6480705738067627},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6429377198219299},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5109540820121765},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5088415741920471},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4811219274997711},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4642333388328552},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44843146204948425},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44212013483047485},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.42476987838745117},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4133976101875305},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3365561068058014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22331419587135315},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06643733382225037},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1091666","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1091666","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2825946636","display_name":null,"funder_award_id":"STC 0939370","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1543491698","https://openalex.org/W1786780942","https://openalex.org/W1983193888","https://openalex.org/W1996575062","https://openalex.org/W2019041817","https://openalex.org/W2035228443","https://openalex.org/W2072646194","https://openalex.org/W2107411554","https://openalex.org/W2129575457","https://openalex.org/W2150516767","https://openalex.org/W2168919539","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W4235911878","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W1604162242","https://openalex.org/W4297688303","https://openalex.org/W1447961680"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,27,160,185,288],"general":[3],"framework":[4],"for":[5,13,179,192],"constructing":[6],"cut":[7,16],"sparsifiers":[8,55,144,273],"in":[9,76,79,227,230,279,300],"undirected":[10,302],"graphs---weighted":[11],"subgraphs":[12],"which":[14,195],"every":[15],"has":[17,184],"the":[18,22,82,128,133,154,173,200,213,233,259,266,295,305],"same":[19],"weight":[20],"as":[21],"original":[23],"graph,":[24],"up":[25],"to":[26,63,124,136,219],"multiplicative":[28],"factor":[29],"of":[30,49,68,81,89,108,149,188,232,240,255,284,291,297,308,319],"$(1":[31],"\\pm":[32],"\\epsilon)$.":[33],"Using":[34],"this":[35,50,141,210],"framework,":[36,51],"we":[37,52,163,171,311],"simplify,":[38],"unify,":[39],"and":[40,70,110,132,151,221,262],"improve":[41],"upon":[42,212],"previous":[43,214],"sparsification":[44,177],"results.":[45,168],"As":[46],"simple":[47],"instantiations":[48],"show":[53],"that":[54,140,274,313],"can":[56],"be":[57,318],"constructed":[58],"by":[59],"sampling":[60],"edges":[61,278],"according":[62,123],"their":[64],"strength":[65],"(a":[66,106],"result":[67,107],"Bencz\u00far":[69,150,220],"Karger":[71,222],"[Approximating":[72,223],"s-t":[73,224],"minimum":[74,225],"cuts":[75,226,299],"o\u0342(n$^2$)":[77,228],"time,":[78,229],"Proceedings":[80,231],"Twenty-Eighth":[83,234],"Annual":[84,235],"ACM":[85,236],"Symposium":[86,237],"on":[87,238,294],"Theory":[88,239],"Computing,":[90,241],"ACM,":[91,242],"New":[92,243],"York,":[93,244],"1996,":[94,245],"pp.":[95,102,117,246,253],"47--55],":[96,247],"[SIAM":[97,112,248],"J.":[98,113,249],"Comput.,":[99,114,250],"44":[100,251],"(2015),":[101,252],"290--319]),":[103],"effective":[104],"resistance":[105],"Spielman":[109],"Srivastava":[111],"40":[115],"(2011),":[116],"1913--1926]),":[118],"or":[119],"edge":[120,125],"connectivity.":[121],"Sampling":[122],"connectivity":[126],"is":[127,196,203,287],"most":[129,134],"aggressive":[130],"method,":[131],"challenging":[135],"analyze.":[137],"Our":[138,182,270],"proof":[139],"method":[142],"produces":[143],"resolves":[145],"an":[146,301],"open":[147],"question":[148],"Karger.":[152],"While":[153],"above":[155],"results":[156],"are":[157],"interesting":[158],"from":[159],"combinatorial":[161],"standpoint,":[162],"also":[164,197,317],"prove":[165],"new":[166],"algorithmic":[167],"In":[169,207],"particular,":[170],"give":[172],"first":[174],"(optimal)":[175],"$O(m)$-time":[176],"algorithm":[178,183,271],"unweighted":[180,260],"graphs.":[181],"running":[186,216],"time":[187],"$O(m)":[189],"+":[190],"\\tilde{O}(n/\\epsilon^2)$":[191],"weighted":[193,267],"graphs,":[194],"linear":[198],"unless":[199],"input":[201],"graph":[202],"very":[204],"sparse":[205],"itself.":[206],"both":[208],"cases,":[209],"improves":[211],"best":[215],"times":[217],"(due":[218],"290--319])":[254],"$O(m\\log^2":[256],"n)$":[257,264],"(for":[258,265],"case)":[261],"$O(m\\log^3":[263],"case),":[268],"respectively.":[269],"constructs":[272],"contain":[275],"$O(n\\log":[276],"n/\\epsilon^2)$":[277],"expectation.":[280],"A":[281],"key":[282],"ingredient":[283],"our":[285,314],"proofs":[286],"natural":[289],"generalization":[290,315],"Karger's":[292,309],"bound":[293],"number":[296],"small":[298],"graph.":[303],"Given":[304],"numerous":[306],"applications":[307],"bound,":[310],"suspect":[312],"will":[316],"independent":[320],"interest.":[321]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}