Tree-residue vertex-breaking: A new tool for proving hardness
© Erik D. Demaine and Mikhail Rudoy. In this paper, we introduce a new problem called Tree-Residue Vertex-Breaking (TRVB): given a multigraph G some of whose vertices are marked "breakable," is it possible to convert G into a tree via a sequence of "vertex-breaking" operations (r...
Main Authors: | Demaine, Erik (Author), Rudoy, Mikhail (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
2021-11-08T19:38:27Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Hamiltonian cycle and related problems : vertex-breaking, grid graphs, and Rubik's Cubes
by: Rudoy, Mikhail
Published: (2018) -
Walking through doors is hard, even without staircases: Proving PSPACE-hardness via planar assemblies of door gadgets
by: Ani, Joshua, et al.
Published: (2020) -
Dissection with the Fewest Pieces is Hard, Even to Approximate
by: Manurangsi, Pasin, et al.
Published: (2018) -
Vertex identification in trees
by: Yuya Kono, et al.
Published: (2021-07-01) -
A new vertex distinguishing total coloring of trees
by: Chao Yang, et al.
Published: (2021-06-01)