{"id":"https://openalex.org/W4386497988","doi":"https://doi.org/10.1145/3623271","title":"Minimum+1 ( <i>s, t</i> )-cuts and Dual-edge Sensitivity Oracle","display_name":"Minimum+1 ( <i>s, t</i> )-cuts and Dual-edge Sensitivity Oracle","publication_year":2023,"publication_date":"2023-09-07","ids":{"openalex":"https://openalex.org/W4386497988","doi":"https://doi.org/10.1145/3623271"},"language":"en","primary_location":{"id":"doi:10.1145/3623271","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3623271","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3623271","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3623271","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059835930","display_name":"Surender Baswana","orcid":"https://orcid.org/0000-0001-8657-7182"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Surender Baswana","raw_affiliation_strings":["Indian Institute of Technology Kanpur, India"],"raw_orcid":"https://orcid.org/0000-0001-8657-7182","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092767056","display_name":"Koustav Bhanja","orcid":"https://orcid.org/0000-0003-0902-0916"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Koustav Bhanja","raw_affiliation_strings":["Indian Institute of Technology Kanpur, India"],"raw_orcid":"https://orcid.org/0000-0003-0902-0916","affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Kanpur, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022015386","display_name":"Abhyuday Pandey","orcid":"https://orcid.org/0000-0002-1222-252X"},"institutions":[{"id":"https://openalex.org/I139490025","display_name":"Limestone College","ror":"https://ror.org/05npsjk50","country_code":"US","type":"education","lineage":["https://openalex.org/I139490025"]},{"id":"https://openalex.org/I139787848","display_name":"Capital University","ror":"https://ror.org/00jy9e726","country_code":"US","type":"education","lineage":["https://openalex.org/I139787848"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abhyuday Pandey","raw_affiliation_strings":["Limestone, Tower Research Capital LLC, United States"],"raw_orcid":"https://orcid.org/0000-0002-1222-252X","affiliations":[{"raw_affiliation_string":"Limestone, Tower Research Capital LLC, United States","institution_ids":["https://openalex.org/I139490025","https://openalex.org/I139787848"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1427,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48240611,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"19","issue":"4","first_page":"1","last_page":"41"},"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.9991000294685364,"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.995199978351593,"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/combinatorics","display_name":"Combinatorics","score":0.7642035484313965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.732142984867096},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6295942664146423},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5777678489685059},{"id":"https://openalex.org/keywords/transversal","display_name":"Transversal (combinatorics)","score":0.45447924733161926},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.45250213146209717},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4493072032928467},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44781070947647095},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4244460165500641},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.41788405179977417},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4055795669555664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14665228128433228}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7642035484313965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.732142984867096},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6295942664146423},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5777678489685059},{"id":"https://openalex.org/C2780130068","wikidata":"https://www.wikidata.org/wiki/Q2208651","display_name":"Transversal (combinatorics)","level":2,"score":0.45447924733161926},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.45250213146209717},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4493072032928467},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44781070947647095},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4244460165500641},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.41788405179977417},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4055795669555664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14665228128433228},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3623271","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3623271","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3623271","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3623271","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3623271","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3623271","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320712","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386497988.pdf","grobid_xml":"https://content.openalex.org/works/W4386497988.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W204237929","https://openalex.org/W976211528","https://openalex.org/W1542177083","https://openalex.org/W1678386955","https://openalex.org/W1964510837","https://openalex.org/W1976106399","https://openalex.org/W1983754496","https://openalex.org/W1989169588","https://openalex.org/W1990802213","https://openalex.org/W1997781543","https://openalex.org/W2022973561","https://openalex.org/W2026486940","https://openalex.org/W2054698857","https://openalex.org/W2111379929","https://openalex.org/W2115049345","https://openalex.org/W2117909275","https://openalex.org/W2168919539","https://openalex.org/W2170531870","https://openalex.org/W2530362908","https://openalex.org/W2536112642","https://openalex.org/W2538944508","https://openalex.org/W2542527648","https://openalex.org/W2680551515","https://openalex.org/W2783552097","https://openalex.org/W2962916904","https://openalex.org/W2963094095","https://openalex.org/W2963228239","https://openalex.org/W2963834565","https://openalex.org/W2963972775","https://openalex.org/W3082938733","https://openalex.org/W3089482228","https://openalex.org/W3106319426","https://openalex.org/W3129188913","https://openalex.org/W3200226237","https://openalex.org/W3210632178","https://openalex.org/W3211891880","https://openalex.org/W4205920801","https://openalex.org/W4206473754","https://openalex.org/W4213060883","https://openalex.org/W4234163381","https://openalex.org/W4244278461","https://openalex.org/W4281566921","https://openalex.org/W4281651135","https://openalex.org/W4313203312"],"related_works":["https://openalex.org/W4235911878","https://openalex.org/W4322810890","https://openalex.org/W4302178876","https://openalex.org/W2115772827","https://openalex.org/W2767688676","https://openalex.org/W115807216","https://openalex.org/W2088200711","https://openalex.org/W2005944337","https://openalex.org/W3210180238","https://openalex.org/W2068595367"],"abstract_inverted_index":{"Let":[0],"G":[1,93,185,406],"be":[2,290],"a":[3,13,19,43,79,246,268,328,360,367],"directed":[4,80,375],"multi-graph":[5],"on":[6,161,434],"n":[7,126,238,304],"vertices":[8,249,403],"and":[9,18,34,67,115,158,220,282,333,354,386,420],"m":[10,172],"edges":[11],"with":[12],"designated":[14,20],"source":[15],"vertex":[16,22],"s":[17],"sink":[21],"t":[23],".":[24,94,407],"We":[25,153,206,365],"study":[26],"the":[27,46,103,155,286,312,325,340,346,378,387,391,409,435,438],"(":[28,50,54,89,108,143,163,190,257,270,274,383],"s,t":[29,51,55,90,109,144,164,191,258,271,384],")-cuts":[30,91],"of":[31,39,61,64,92,106,137,184,228,248,327,389,393],"capacity":[32,138,326,392],"minimum+1":[33,142,162,181,189,223,269],"as":[35,99,194],"an":[36,53,100,124,170,212,236,256,302],"important":[37],"application":[38],"them,":[40],"we":[41,357],"give":[42],"solution":[44],"to":[45,323,338,429],"dual-edge":[47,313,379],"sensitivity":[48,105,314,380],"for":[49,102,141,218,316,382,400,437],")-mincuts\u2014reporting":[52],")-mincut":[56],"upon":[57],"failure":[58],"or":[59],"insertion":[60],"any":[62,198,401],"pair":[63,247],"edges.":[65],"Picard":[66],"Queyranne":[68],"[Mathematical":[69],"Programming":[70],"Studies,":[71],"13(1):":[72],"8\u201316":[73],"(1980)]":[74],"showed":[75,120],"that":[76,84,121,132,178,187,209,251,278,310],"there":[77,122,210,266],"exists":[78,123,150,235,267,301],"acyclic":[81],"graph":[82],"(DAG)":[83],"compactly":[85],"stores":[86,133,179],"all":[87,134,180,222],"minimum":[88,107],"This":[95],"structure":[96,149,177,202,217,243,309,348],"also":[97,207,358],"acts":[98],"oracle":[101],"single-edge":[104],")-cut.":[110],"For":[111,345],"undirected":[112],"multi-graphs,":[113],"Dinitz":[114],"Nutov":[116],"[STOC,":[117],"509\u2013518":[118],"(1995)]":[119],"\ud835\udcaa(":[125,171,213,237,303],")":[127,173,215,240,306],"size":[128,174,216,241,307],"2-level":[129,175],"Cactus":[130],"model":[131],"global":[135],"cuts":[136],"minimum+1.":[139],"However,":[140],")-cuts,":[145],"no":[146],"such":[147,186,277],"compact":[148],"till":[151],"date.":[152],"present":[154],"following":[156],"structural":[157],"algorithmic":[159],"results":[160,352],")-cuts.":[165],"(1)":[166],"Structure:":[167],"There":[168,234,300],"is":[169,211],"DAG":[176],"(s,t)":[182,224,317,330],"-cuts":[183,225],"each":[188],")-cut":[192],"appears":[193],"3-transversal":[195],"cut\u2014it":[196],"intersects":[197],"path":[199],"in":[200,226,262,292,351,405],"this":[201,427],"at":[203],"most":[204],"thrice.":[205],"show":[208],"mn":[214],"storing":[219],"characterizing":[221],"terms":[227],"1-transversal":[229],"cuts.":[230],"(2)":[231,353],"Data":[232],"structure:":[233],"2":[239,305],"data":[242,308,347],"that,":[244],"given":[245],"{u,v}":[250],"are":[252],"not":[253],"separated":[254],"by":[255,413],")-mincut,":[259],"can":[260,289],"determine":[261],"\ud835\udcaa(1)":[263,321],"time":[264,322,337],"if":[265],")-cut,":[272],"say":[273],"A,B":[275],"),":[276],"s,u":[279],"\u220a":[280],"A":[281],"v,t\u220a":[283],"B":[284,294,335],";":[285],"corresponding":[287],"cut":[288],"reported":[291],"\ud835\udcaa(|":[293,334],"|)":[295,336],"time.":[296],"(3)":[297,355],"Sensitivity":[298],"oracle:":[299],"solves":[311],"problem":[315,381,388],"-mincuts.":[318],"It":[319],"takes":[320],"report":[324,339],"resulting":[329],"-mincut":[331],"(A,B)":[332],"cut.":[341],"(4)":[342],"Lower":[343],"bounds:":[344],"problems":[349],"addressed":[350],"above,":[356],"provide":[359],"matching":[361],"conditional":[362],"lower":[363,432],"bound.":[364],"establish":[366],"close":[368],"relationship":[369],"among":[370],"three":[371],"seemingly":[372],"unrelated":[373],"problems\u2014all-pairs":[374],"reachability":[376],"problem,":[377],")-mincuts,":[385],"reporting":[390],"({":[394],"x,y":[395],"},":[396],"{":[397],"u,v":[398],"})-mincut":[399],"four":[402],"x,y,u,v":[404],"Assuming":[408],"Directed":[410],"Reachability":[411],"Hypothesis":[412],"Patrascu":[414],"[SIAM":[415],"J.":[416],"Computing,":[417],"827\u2013847":[418],"(2011)]":[419],"Goldstein":[421],"et":[422],"al.":[423],"[WADS,":[424],"421\u2013436":[425],"(2017)],":[426],"leads":[428],"\\(\\tilde{\\Omega":[430],"}(n^2)\\)":[431],"bounds":[433],"space":[436],"latter":[439],"two":[440],"problems.":[441]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}