{"id":"https://openalex.org/W7167631135","doi":"https://doi.org/10.48550/arxiv.2607.03266","title":"An FPT Algorithm for Diverse Minimum s-t Cuts","display_name":"An FPT Algorithm for Diverse Minimum s-t Cuts","publication_year":2026,"publication_date":"2026-07-03","ids":{"openalex":"https://openalex.org/W7167631135","doi":"https://doi.org/10.48550/arxiv.2607.03266"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.03266","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.03266","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.03266","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140161061","display_name":"Krishnan Dehaleesan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dehaleesan, Krishnan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064442594","display_name":"P\u00e5l Gr\u00f8n\u00e5s Drange","orcid":"https://orcid.org/0000-0001-7228-6640"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Drange, P\u00e5l Gr\u00f8n\u00e5s","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140176748","display_name":"Fedor V. Fomin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fomin, Fedor V.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140217830","display_name":"Petr A. Golovach","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Golovach, Petr A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140165767","display_name":"Laure Morelle","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morelle, Laure","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6442000269889832,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.6442000269889832,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2614000141620636,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.02590000070631504,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5942999720573425},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5449000000953674},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48350000381469727},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.47920000553131104},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4226999878883362},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.37630000710487366},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.3644999861717224},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.35530000925064087}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6608999967575073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.640500009059906},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5942999720573425},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5480999946594238},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5449000000953674},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48350000381469727},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.47920000553131104},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4226999878883362},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41659998893737793},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.37630000710487366},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35530000925064087},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3310000002384186},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.30640000104904175},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3012000024318695},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.03266","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.03266","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.03266","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.03266","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,25,47,52,69,112,121,149],"problem":[3,70,88,113],"of":[4,8,49,55,130,139,148,152],"finding":[5],"a":[6,15,145],"family":[7],"diverse":[9,140],"minimum":[10,34,74,141],"edge":[11],"s-t":[12,35,75,142],"cuts":[13,36,76,143],"in":[14,45,51,77],"directed":[16],"weighted":[17],"graph":[18],"G.":[19],"Given":[20],"integers":[21],"k":[22,33,97,124],"and":[23,57,83,144,156],"d,":[24],"task":[26],"is":[27,59,80,89,114],"to":[28,72,92],"decide":[29],"whether":[30],"G":[31],"contains":[32],"C_1,":[37],"...,":[38],"C_k":[39],"such":[40],"that":[41,111],"for":[42,96],"any":[43],"i,j":[44],"[k],":[46],"number":[48],"edges":[50],"symmetric":[53],"difference":[54],"C_i":[56],"C_j":[58],"at":[60],"least":[61],"d.":[62,126],"For":[63],"d":[64],"being":[65],"1":[66],"or":[67],"2,":[68],"corresponds":[71],"counting":[73],"G,":[78],"which":[79],"#P-complete":[81],"[Provan":[82],"Ball,":[84],"SICOMP":[85],"1983].":[86],"The":[87,127],"also":[90],"known":[91],"be":[93],"NP-complete":[94],"already":[95],"=":[98],"3":[99],"[de":[100],"Berg,":[101],"L\u00f3pez":[102],"Mart\u00ednez,":[103],"Spieksma,":[104],"ISAAC":[105],"2024].":[106],"Our":[107],"main":[108,128],"result":[109],"shows":[110],"fixed-parameter":[115],"tractable":[116],"(FPT)":[117],"when":[118],"parameterized":[119],"by":[120],"combined":[122],"parameter":[123],"+":[125],"ingredients":[129],"our":[131],"FPT":[132],"algorithm":[133],"build":[134],"on":[135],"novel":[136],"structural":[137],"properties":[138],"non-trivial":[146],"application":[147],"flow-augmentation":[150],"technique":[151],"Kim,":[153],"Kratsch,":[154],"Pilipczuk,":[155],"Wahlstr\u00f6m":[157],"[JACM":[158],"2025].":[159]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-08T00:00:00"}