{"id":"https://openalex.org/W7161144160","doi":"https://doi.org/10.48550/arxiv.2605.13402","title":"Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm","display_name":"Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161144160","doi":"https://doi.org/10.48550/arxiv.2605.13402"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.13402","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13402","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"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.2605.13402","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014855196","display_name":"Christian M\u00f8ller Mikkelstrup","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mikkelstrup, Christian M\u00f8ller","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031953389","display_name":"Anders Bjorholm Dahl","orcid":"https://orcid.org/0000-0002-0068-8170"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dahl, Anders Bjorholm","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083100766","display_name":"Philip Bille","orcid":"https://orcid.org/0000-0002-1120-5154"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bille, Philip","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012770020","display_name":"Vedrana Andersen Dahl","orcid":"https://orcid.org/0000-0001-6734-5570"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dahl, Vedrana Andersen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5070148734","display_name":"Inge Li G\u00f8rtz","orcid":"https://orcid.org/0000-0002-8322-4952"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G\u00f8rtz, Inge Li","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/T12292","display_name":"Graph Theory and Algorithms","score":0.1428000032901764,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.1428000032901764,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.10830000042915344,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.05389999970793724,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5684999823570251},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5223000049591064},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.48730000853538513},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4302999973297119},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.39629998803138733},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.39259999990463257},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.3869999945163727},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3752000033855438}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6140999794006348},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5684999823570251},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5223000049591064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5116999745368958},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.48730000853538513},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.39629998803138733},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.39259999990463257},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.3869999945163727},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35760000348091125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3504999876022339},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.33160001039505005},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3158999979496002},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.313400000333786},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.30469998717308044},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2676999866962433}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.13402","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13402","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.13402","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13402","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"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":{"Computing":[0],"a":[1,6,9,12,38,61,72,100,110,115,126,154],"minimum":[2,111,179],"$s$-$t$":[3,112,180],"cut":[4,113,181],"in":[5,114],"graph":[7,102,116],"is":[8,20],"solution":[10],"to":[11,57,108,141],"wide":[13],"range":[14],"of":[15,43,49,53,75,85,88,93,119,131,137,147,157,163],"computer":[16],"vision":[17],"problems,":[18],"and":[19,40,59,66,80,90,122,175],"often":[21],"done":[22],"using":[23],"the":[24,33,47,50,54,64,83,91,94,138,143,148,161],"Boykov-Kolmogorov":[25],"(BK)":[26],"algorithm.":[27],"In":[28],"this":[29],"paper,":[30],"we":[31],"revisit":[32],"BK":[34,55,68,139,149],"algorithm":[35,56,140,150],"from":[36],"both":[37],"theoretical":[39],"practical":[41],"point":[42],"view.":[44],"We":[45,97,133,166],"improve":[46],"analysis":[48],"time":[51,73],"complexity":[52,74],"$O(mn|C|)$":[58],"propose":[60,99],"new":[62],"algorithm,":[63,70],"fast":[65],"compact":[67,101],"(fcBK)":[69],"with":[71,117,128],"$O(m|C|)$,":[76],"where":[77],"$m$,":[78],"$n$,":[79],"$|C|$":[81],"are":[82],"number":[84,87],"edges,":[86],"vertices,":[89],"capacity":[92],"cut,":[95],"respectively.":[96],"additionally":[98],"representation":[103],"that":[104],"allows":[105],"our":[106,135,168],"implementation":[107,136,146,176],"find":[109,134],"upwards":[118],"$10^9$":[120],"vertices":[121],"$10^{10}$":[123],"edges":[124],"on":[125,153],"machine":[127],"128":[129],"GB":[130],"memory.":[132],"be":[142],"fastest":[144],"available":[145,171],"when":[151],"evaluating":[152],"comprehensive":[155],"set":[156],"benchmark":[158],"datasets,":[159],"highlighting":[160],"importance":[162],"memory-efficient":[164],"implementations.":[165],"make":[167],"implementations":[169],"publicly":[170],"for":[172],"further":[173],"research":[174],"development":[177],"within":[178],"algorithms.":[182]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-15T00:00:00"}