{"id":"https://openalex.org/W7139985531","doi":"https://doi.org/10.7155/jgaa.v30i1.2998","title":"Stable and Dynamic Minimum Cuts","display_name":"Stable and Dynamic Minimum Cuts","publication_year":2026,"publication_date":"2026-03-20","ids":{"openalex":"https://openalex.org/W7139985531","doi":"https://doi.org/10.7155/jgaa.v30i1.2998"},"language":null,"primary_location":{"id":"doi:10.7155/jgaa.v30i1.2998","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.2998","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/2998/3023","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://jgaa.info/index.php/jgaa/article/download/2998/3023","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5129624831","display_name":"Andr\u00e9s L\u00f3pez Mart\u00ednez","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Andres Lopez Martinez","raw_affiliation_strings":["Eindhoven University of Technology"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113668100","display_name":"Mark de Berg","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark De Berg","raw_affiliation_strings":["Eindhoven University of Technology"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130291335","display_name":"Frits Spieksma","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Frits Spieksma","raw_affiliation_strings":["Eindhoven University of Technology"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5129624831"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.8168784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"1","first_page":"89","last_page":"107"},"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.8562999963760376,"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.8562999963760376,"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.054099999368190765,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.020999999716877937,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/vertex","display_name":"Vertex (graph theory)","score":0.7430999875068665},{"id":"https://openalex.org/keywords/amortized-analysis","display_name":"Amortized analysis","score":0.546999990940094},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5467000007629395},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5241000056266785},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.444599986076355},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.43849998712539673},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.3939000070095062},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.3824000060558319}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7430999875068665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7407000064849854},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7113000154495239},{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.546999990940094},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5467000007629395},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5241000056266785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.444599986076355},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.43849998712539673},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3939000070095062},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37470000982284546},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.37119999527931213},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.29350000619888306},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.28949999809265137},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.27140000462532043},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2567000091075897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7155/jgaa.v30i1.2998","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.2998","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/2998/3023","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.7155/jgaa.v30i1.2998","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.2998","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/2998/3023","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1399324874","display_name":null,"funder_award_id":"024.002.00","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G1627402428","display_name":"NETWORKS Doctoral Program","funder_award_id":"945045","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G2689612763","display_name":null,"funder_award_id":"Marie","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3413111253","display_name":null,"funder_award_id":"NETWORKS","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7139985531.pdf","grobid_xml":"https://content.openalex.org/works/W7139985531.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,24],"consider":[1],"the":[2,21,26,29,98,132,138,142,153],"two":[3],"problems":[4],"of":[5,12,31,36,131,177],"maintaining":[6,13,119,146,168],"an":[7,42],"exact":[8,147],"minimum":[9,34,148],"cut,":[10,16,171],"and":[11,115,126,182],"a":[14,32,48,56,71,93,120,169,174,184],"$\\rho$-approximate":[15,121,170],"in":[17,55,102,123,141],"dynamic":[18],"graphs":[19],"under":[20],"vertex-arrival":[22,100],"model.":[23],"investigate":[25,137],"trade-off":[27,140],"between":[28],"stability":[30,83,157,189],"solution---the":[33],"number":[35],"vertex":[37,50,68,72,180],"flips":[38,69],"required":[39],"to":[40,88,163],"transform":[41],"induced":[43],"bipartition":[44],"into":[45],"another":[46],"when":[47],"new":[49],"arrives---and":[51],"its":[52],"quality.":[53],"Trivially,":[54],"graph":[57],"with":[58,66,187],"$n$":[59],"vertices":[60],"any":[61],"cut":[62,122],"can":[63],"be":[64],"maintained":[65],"$n/2$":[67],"upon":[70],"arrival.":[73],"For":[74,145],"both":[75,124],"our":[76],"problems,":[77],"we":[78,109,135,150,172],"obtain":[79],"that":[80,96,111,152],"this":[81],"trivial":[82,154],"bound":[84,158,176],"is":[85,106,159],"tight":[86,161],"up":[87,162],"constant":[89,164],"factors,":[90],"even":[91],"for":[92,118,167],"clairvoyant":[94],"algorithm---one":[95],"knows":[97],"entire":[99],"sequence":[101],"advance.":[103],"When":[104],"$\\rho$":[105],"large":[107],"enough,":[108],"show":[110,151,173],"there":[112],"are":[113],"simple":[114],"stable":[116],"algorithms":[117],"general":[125],"planar":[127],"graphs.":[128],"In":[129],"view":[130],"negative":[133],"results,":[134],"also":[136,160],"quality-stability":[139],"amortized":[143,156,188],"sense.":[144],"cuts,":[149],"$O(n)$":[155],"factors.":[165],"However,":[166],"lower":[175],"$\\Omega(\\frac{n}{\\rho^2})$":[178],"average":[179],"flips,":[181],"give":[183],"(clairvoyant)":[185],"algorithm":[186],"$O\\left(":[190],"\\frac{n":[191],"\\log":[192,194],"n}{\\rho":[193],"\\rho}":[195],"\\right)$.":[196]},"counts_by_year":[],"updated_date":"2026-04-03T22:45:19.894376","created_date":"2026-03-22T00:00:00"}