{"id":"https://openalex.org/W2060137734","doi":"https://doi.org/10.1137/s0097539794273083","title":"An $\\NC$ Algorithm for Minimum Cuts","display_name":"An $\\NC$ Algorithm for Minimum Cuts","publication_year":1997,"publication_date":"1997-02-01","ids":{"openalex":"https://openalex.org/W2060137734","doi":"https://doi.org/10.1137/s0097539794273083","mag":"2060137734"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794273083","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794273083","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/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David R. Karger","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112649653","display_name":"Rajeev Motwani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajeev Motwani","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.55,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.82811791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":"1","first_page":"255","last_page":"272"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9958000183105469,"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/maximum-cut","display_name":"Maximum cut","score":0.758357048034668},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7117773294448853},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6754640340805054},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.6159806847572327},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5895896553993225},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5835429430007935},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.581492006778717},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5373526811599731},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4980340003967285},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4862002730369568},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44320785999298096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37206751108169556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18061700463294983},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12009832262992859}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.758357048034668},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7117773294448853},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6754640340805054},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.6159806847572327},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5895896553993225},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5835429430007935},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.581492006778717},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5373526811599731},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4980340003967285},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4862002730369568},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44320785999298096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37206751108169556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18061700463294983},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12009832262992859},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539794273083","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794273083","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.5519","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.5519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://theory.lcs.mit.edu/pub/people/karger/detcut-journal.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.33.1701","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1701","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.lcs.mit.edu/~karger/Papers/detcut.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W41039768","https://openalex.org/W1496921672","https://openalex.org/W1981234161","https://openalex.org/W1981519953","https://openalex.org/W1983465613","https://openalex.org/W2002531683","https://openalex.org/W2005944337","https://openalex.org/W2009339416","https://openalex.org/W2019038806","https://openalex.org/W2035228443","https://openalex.org/W2046461289","https://openalex.org/W2048958388","https://openalex.org/W2049182037","https://openalex.org/W2049327803","https://openalex.org/W2059378738","https://openalex.org/W2073975876","https://openalex.org/W2078960854","https://openalex.org/W2100061495","https://openalex.org/W2110824700","https://openalex.org/W2117889403","https://openalex.org/W2118541957","https://openalex.org/W2121204510","https://openalex.org/W2295428206","https://openalex.org/W2610479830","https://openalex.org/W2610729871","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W2903538031","https://openalex.org/W2129497110","https://openalex.org/W2115772827","https://openalex.org/W1974018476","https://openalex.org/W2942946217","https://openalex.org/W2018130031","https://openalex.org/W2952550543","https://openalex.org/W1543491698"],"abstract_inverted_index":{"We":[0,99],"show":[1],"that":[2,66,83,101],"the":[3,34,44,48,55,102,142],"minimum-cut":[4,45],"problem":[5,46,49,65],"for":[6,29,127,153,160,174],"weighted":[7],"undirected":[8],"graphs":[9],"can":[10,67],"be":[11,68],"solved":[12,69],"in":[13,71,108],"$\\NC$":[14,27,121,151,169],"using":[15],"three":[16],"separate":[17],"and":[18,94,131],"independently":[19],"interesting":[20],"results.":[21],"The":[22,37,73,112],"first":[23],"is":[24,39,76],"an":[25,150,168],"$(m^2/n)$-processor":[26],"algorithm":[28,152],"finding":[30,123,132,154],"a":[31,40,52,61,77,85,155],"$(2+\\epsilon)$-approximation":[32,53],"to":[33,47,54,115],"minimum":[35,56,124],"cut.":[36,57],"second":[38],"randomized":[41],"reduction":[42,59],"from":[43],"of":[50,79,87,135,141,146,165,177],"obtaining":[51],"This":[58],"involves":[60],"natural":[62],"combinatorial":[63],"set-isolation":[64,103],"easily":[70],"$\\RNC$.":[72],"third":[74],"result":[75],"derandomization":[78,110],"this":[80],"$\\RNC$":[81],"solution":[82],"requires":[84],"combination":[86],"two":[88,116],"widely":[89],"used":[90],"tools:":[91],"pairwise":[92],"independence":[93],"random":[95],"walks":[96],"on":[97],"expanders.":[98],"believe":[100],"approach":[104],"will":[105],"prove":[106],"useful":[107],"other":[109],"problems.":[111],"techniques":[113,148],"extend":[114],"related":[117],"problems:":[118],"we":[119],"describe":[120],"algorithms":[122],"k-way":[125],"cuts":[126,134],"any":[128,138],"constant":[129,139],"k":[130],"all":[133,161],"value":[136],"within":[137],"factor":[140],"minimum.":[143],"Another":[144],"application":[145],"these":[147],"yields":[149],"{\\em":[156],"sparse":[157],"k-connectivity":[158],"certificate}":[159],"polynomially":[162],"bounded":[163],"values":[164,176],"k.":[166,178],"Previously,":[167],"construction":[170],"was":[171],"only":[172],"known":[173],"polylogarithmic":[175]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}