Sciweavers

2 search results - page 1 / 1
» Error Compensation in Leaf Root Problems
Sort
View
ISAAC
2004
Springer
94views Algorithms» more  ISAAC 2004»
13 years 9 months ago
Error Compensation in Leaf Root Problems
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...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...
ALGORITHMICA
2006
100views more  ALGORITHMICA 2006»
13 years 4 months ago
Error Compensation in Leaf Power Problems
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...
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Ni...