Reconfiguration of Spanning Trees with Many or Few Leaves
From MaRDI portal
Publication:5874492
DOI10.4230/LIPICS.ESA.2020.24OpenAlexW3082258454MaRDI QIDQ5874492FDOQ5874492
Authors: Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Paul Ouvrard, Akira Suzuki, Kunihiro Wasa, Nicolas Bousquet 
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.14309
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- The complexity of change
- A survey on the use of Markov chains to randomly sample colourings
- On the complexity of reconfiguration problems
- Token sliding on chordal graphs
- Token sliding on split graphs
- The complexity of dominating set reconfiguration
- Introduction to reconfiguration
- Reconfiguration in bounded bandwidth and tree-depth
- The coloring reconfiguration problem on specific graph classes
- Reconfiguring spanning and induced subgraphs
- Shortest reconfiguration of matchings
- Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
Cited In (6)
- Feedback vertex set reconfiguration in planar graphs
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
- Reconfiguration of time-respecting arborescences
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree
- Reconfiguration of spanning trees with degree constraints or diameter constraints
- Brief announcement: Distributed reconfiguration of spanning trees
This page was built for publication: Reconfiguration of Spanning Trees with Many or Few Leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874492)
