Reconfiguration of connected graph partitions via recombination

DOI10.1007/978-3-030-75242-2_4OpenAlexW3164132973MaRDI QIDQ5925672

Oliver Korten, Csaba D. Tóth, Matias Korman, Diane L. Souvaine, Hugo A. Akitaya

Publication date: 22 March 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_4

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the Maximally Balanced Connected Partition Problem in graphs
• Approximation algorithm for the balanced 2-connected \(k\)-partition problem
• A linear algorithm for bipartition of biconnected graphs
• On the complexity of partitioning graphs into connected subgraphs
• Random generation of combinatorial structures from a uniform distribution
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• A Theorem on Planar Graphs
• A homology theory for spanning tress of a graph
• Doubly Balanced Connected Graph Partitioning
• Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
• Geometry of Graph Partitions via Optimal Transport
• Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs