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: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
2021-11-08T19:38:27Z.
|
| Subjects: | |
| Online Access: | Get fulltext |