Reconfiguration of vertex covers in a graph
DOI10.1007/978-3-319-19315-1_15zbMATH Open1401.68250OpenAlexW1156529421MaRDI QIDQ2946052FDOQ2946052
Authors: Takehiro Ito, Hiroyuki Nooka, Xiao Zhou 
Publication date: 15 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_15
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Vertex Cover Reconfiguration and Beyond
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
- Complexity of independent set reconfigurability problems
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- On the complexity of reconfiguration problems
- Even-hole-free graphs. I: Decomposition theorem
Cited In (10)
- On reconfigurability of target sets
- Reorientations of covering graphs
- TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$
- Introduction to reconfiguration
- Title not available (Why is that?)
- The complexity of dominating set reconfiguration
- Vertex Cover Reconfiguration and Beyond
- Reconfiguration of cliques in a graph
- Reconfiguration of maximum-weight \(b\)-matchings in a graph
- Reconfiguration of Steiner trees in an unweighted graph
This page was built for publication: Reconfiguration of vertex covers in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946052)
