| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952003 | Theoretical Computer Science | 2017 | 13 Pages |
Abstract
Our contributions comprise hardness results for very restricted cases, linear time algorithms for trees, and a probabilistic upper bound.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Carlos V.G.C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme L. Szwarcfiter,