Reconfiguration of connected graph partitions via recombination

DOI10.1016/j.tcs.2022.04.049OpenAlexW3102096961MaRDI QIDQ5925556

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

Publication date: 13 June 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.07378

zbMATH Keywords

configuration spacerecombinationbalanced partitionconnected graph partition

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Irreducibility of recombination Markov chains in the triangular lattice ⋮ Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans

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
• Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
• Doubly Balanced Connected Graph Partitioning
• Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
• Automated Redistricting Simulation Using Markov Chain Monte Carlo
• Geometry of Graph Partitions via Optimal Transport

This page was built for publication: Reconfiguration of connected graph partitions via recombination