{"id":"https://openalex.org/W1984361668","doi":"https://doi.org/10.1145/1538902.1538903","title":"Graph partitioning using single commodity flows","display_name":"Graph partitioning using single commodity flows","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W1984361668","doi":"https://doi.org/10.1145/1538902.1538903","mag":"1984361668"},"language":"en","primary_location":{"id":"doi:10.1145/1538902.1538903","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1538902.1538903","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5074837451","display_name":"Rohit Khandekar","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rohit Khandekar","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Hawthorne, New York","IBM Thomas J. Watson Research Center, Hawthorne, New York#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Hawthorne, New York","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Hawthorne, New York#TAB#","institution_ids":["https://openalex.org/I4210114115"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082369624","display_name":"Satish Rao","orcid":"https://orcid.org/0000-0002-7353-333X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Satish Rao","raw_affiliation_strings":["University of California, Berkeley, CA","University of California: Berkeley, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, CA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California: Berkeley, CA#TAB#","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071039750","display_name":"Umesh Vazirani","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Umesh Vazirani","raw_affiliation_strings":["University of California, Berkeley, CA","University of California: Berkeley, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, CA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California: Berkeley, CA#TAB#","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7361,"has_fulltext":false,"cited_by_count":88,"citation_normalized_percentile":{"value":0.97024152,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"56","issue":"4","first_page":"1","last_page":"15"},"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6615571975708008},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.552474856376648},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5307251214981079},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4918863773345947},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4602900743484497},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4589245617389679},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4363173544406891},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39565330743789673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3634703457355499},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07921895384788513}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6615571975708008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.552474856376648},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5307251214981079},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4918863773345947},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4602900743484497},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4589245617389679},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4363173544406891},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39565330743789673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3634703457355499},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07921895384788513}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1538902.1538903","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1538902.1538903","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1553598118","https://openalex.org/W1588155622","https://openalex.org/W1966461475","https://openalex.org/W1974785036","https://openalex.org/W1977545325","https://openalex.org/W1993111701","https://openalex.org/W1995547833","https://openalex.org/W2018804864","https://openalex.org/W2020632401","https://openalex.org/W2024778356","https://openalex.org/W2033852356","https://openalex.org/W2045107949","https://openalex.org/W2051540665","https://openalex.org/W2070232376","https://openalex.org/W2078013954","https://openalex.org/W2098651744","https://openalex.org/W2099463627","https://openalex.org/W2107881198","https://openalex.org/W2114030927","https://openalex.org/W2117595194","https://openalex.org/W2120970098","https://openalex.org/W2121284046","https://openalex.org/W2150148016","https://openalex.org/W2161455936","https://openalex.org/W2165956524","https://openalex.org/W2169124940","https://openalex.org/W2176446742","https://openalex.org/W3016299094","https://openalex.org/W6633044140","https://openalex.org/W6675201032"],"related_works":["https://openalex.org/W2139356568","https://openalex.org/W3107976745","https://openalex.org/W1543904360","https://openalex.org/W2049971620","https://openalex.org/W2118860231","https://openalex.org/W2028468530","https://openalex.org/W2419219947","https://openalex.org/W2085124875","https://openalex.org/W3102280101","https://openalex.org/W2963656294"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,45],"the":[3,88],"sparsest":[4],"cut":[5],"in":[6,24],"graphs":[7],"with":[8,91],"n":[9,21,28,51,83],"vertices":[10],"and":[11],"m":[12,26,49],"edges":[13],"can":[14,73],"be":[15,75],"approximated":[16],"within":[17],"O":[18,80],"(log":[19,81],"2":[20,52,82],")":[22,30],"factor":[23],"\u00d5(":[25,48],"+":[27,50],"3/2":[29],"time":[31,47],"using":[32],"polylogarithmic":[33],"single":[34],"commodity":[35],"max-flow":[36,58],"computations.":[37],"Previous":[38],"algorithms":[39],"are":[40],"based":[41],"on":[42],"multicommodity":[43],"flows":[44],"take":[46],").":[53],"Our":[54,71],"algorithm":[55,86],"iteratively":[56],"employs":[57],"computations":[59],"to":[60,77],"embed":[61],"an":[62,79],"expander":[63],"flow,":[64],"thus":[65],"providing":[66],"a":[67,92],"certificate":[68],"of":[69],"expansion.":[70],"technique":[72],"also":[74],"extended":[76],"yield":[78],")-(pseudo-)":[84],"approximation":[85],"for":[87],"edge-separator":[89],"problem":[90],"similar":[93],"running":[94],"time.":[95]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}