Minimum separator reconfiguration
From MaRDI portal
Publication:6615312
DOI10.1016/J.JCSS.2024.103574MaRDI QIDQ6615312
Clément Legrand-Duchesne, Reem Mahmoud, Yoshio Okamoto, Guilherme C. M. Gomes, Vinícius Fernandes dos Santos, Amer E. Mouawad, Tom C. van der Zanden
Publication date: 8 October 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Cites Work
- On the parameterized complexity of reconfiguration problems
- Infeasibility of instance compression and succinct PCPs for NP
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem
- Approximability of partitioning graphs with supply and demand
- On problems without polynomial kernels
- A partial k-arboretum of graphs with bounded treewidth
- Straightening polygonal arcs and convexifying polygonal cycles
- Zur allgemeinen Kurventheorie.
- Reconfiguration graphs for dominating sets
- In most 6-regular toroidal graphs all 5-colorings are Kempe equivalent
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs
- Finding small separators in linear time via treewidth reduction
- Parameters Tied to Treewidth
- New Limits to Classical and Quantum Instance Compression
- Graph minors. II. Algorithmic aspects of tree-width
- The Parameterized Complexity of the k -Biclique Problem
- The Complexity of Independent Set Reconfiguration on Bipartite Graphs
- Kernelization Lower Bounds by Cross-Composition
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
- Parameterized Algorithms
- On finding short reconfiguration sequences between independent sets
This page was built for publication: Minimum separator reconfiguration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615312)
