Reconfiguration of Steiner Trees in an Unweighted Graph

DOI10.1007/978-3-319-44543-4_13zbMath1478.68253OpenAlexW2541091937MaRDI QIDQ2819500

Haruka Mizuta, Takehiro Ito, Xiao Zhou

Publication date: 29 September 2016

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-44543-4_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect ⋮ Introduction to reconfiguration

Cites Work

• Unnamed Item
• Complexity of independent set reconfigurability problems
• Linear-time algorithm for sliding tokens on trees
• On the complexity of reconfiguration problems
• Relationships between nondeterministic and deterministic tape complexities
• The complexity of change
• Vertex Cover Reconfiguration and Beyond
• Reconfiguration of Vertex Covers in a Graph
• Reconfiguration of Cliques in a Graph
• Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• Graph Classes: A Survey
• Parameterized Complexity of Graph Constraint Logic
• The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

This page was built for publication: Reconfiguration of Steiner Trees in an Unweighted Graph