Error Compensation in Leaf Root Problems

@inproceedings{Dom2004ErrorCI,
  title={Error Compensation in Leaf Root Problems},
  author={Michael Dom and Jiong Guo and Falk H{\"u}ffner and Rolf Niedermeier},
  booktitle={ISAAC},
  year={2004}
}
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 most l edges to generate a graph that has a k-leaf root. We provide several NP-completeness results in this context, and we show that the NP-complete Closest 3Leaf Root problem (the error correction version of 3-Leaf Root) is fixed-parameter tractable with respect to the number of edge modifications in the given graph. Thus… CONTINUE READING