| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952097 | Theoretical Computer Science | 2017 | 13 Pages |
Abstract
We also examine variants of the basic editing to obtain a regular subgraph problem from the perspective of parameterizing by the treewidth of the input graph. In this case the treewidth of the input graph essentially becomes a limiting parameter on the natural k+r parameterization.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Luke Mathieson,