4 search results - page 1 / 1 » Extending the Tractability Border for Closest Leaf Powers |
WG
2005
Springer
13 years 10 months ago
2005
Springer
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...
DAM
2008
13 years 4 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
ALGORITHMICA
2006
13 years 4 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...