Extending the Tractability Border for Closest Leaf Powers
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 power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree—the 4-leaf root—with leaves one-to-one labeled by the graph vertices, where we connect two graph vertices by an edge iff their corresponding leaves are at distance at most 4 in the tree. Complementing and “completing” previous work on Closest 2-Leaf Power and Closest 3-Leaf Power, we show that Closest 4-Leaf Power is fixed-parameter tractable with respect to parameter ℓ.
KeywordsMaximal Clique Error Compensation Input Graph Recursive Call Output Graph
Unable to display preview. Download preview PDF.
- 1.Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. In: Proc. 44th FOCS, pp. 524–533. IEEE Computer Society, Los Alamitos (2003); To appear in J. Comput. System Sci.Google Scholar
- 5.Jiang, T., Lin, G., Xu, J.: On the closest tree kth root problem. Manuscript, Department of Computer Science, University of Waterloo (2000)Google Scholar
- 11.Natanzon, A.: Complexity and approximation of some graph modification problems. Master’s thesis, Department of Computer Science, Tel Aviv University (1999)Google Scholar
- 13.Rautenbach, D.: 4-leafroots. Manuscript, Forschungsinstitut für Diskrete Mathematik, Universität Bonn (June 2004)Google Scholar