Error compensation in leaf power problems

Algorithmica (New York)

Volumn 44, Issue 4, 2006, Pages 363-381

  Dom, Michael ^a   Guo, Jiong ^a   Huffner, Falk ^a   Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Fixed parameter tractability; Forbidden subgraph characterization; Graph algorithms; Graph modification; Graph power; Leaf power; NP completeness

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; TREES (MATHEMATICS);

GRAPH ALGORITHMS; GRAPH POWER; K-LEAF POWER RECOGNITION;

GRAPH THEORY;

EID: 32944471408     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1180-z     Document Type: Article

References (36)

1. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning, 56(1):89-113, 2004.
2. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: a Survey. Monographs on Discrete Mathematics and Applications. SLAM, Philadelphia, PA, 1999.
3. L. Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58:171-176, 1996.
4. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. Journal of Computer and System Sciences, 71(3):360-383, 2005.
5. Z.-Z. Chen, T. Jiang, and G. Lin. Computing phylogenetic roots with bounded degrees and errors. SIAM Journal on Computing, 32(4):864-879, 2003.
6. Z.-Z. Chen and T. Tsukiji. Computing bounded-degree phylogenetic roots of disconnected graphs. In Proc. 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '04), pages 308-319. Volume 3353 of LNCS. Springer-Verlag, Berlin, 2004.
7. Long version to appear in Journal of Algorithms.
8. M. Dom. Fehler-Korrektur bei Leaf-Root-Problemen (error compensation in leaf root problems). Diploma thesis (in German), Universität Tübingen, 2004.
9. M. Dom, J. Guo, F. Hüffner, and R. Niedermeier. Error compensation in leaf root problems. In Proc. 15th Annual International Symposium on Algorithms and Computation (ISAAC '04), pages 389-401. Volume 3341 of LNCS. Springer-Verlag, Berlin, 2004.
10. M. Dom, J. Guo, F. Hüffner, and R. Niedermeier. Extending the tractability border for closest leaf powers. In Proc. 31sf International Workshop on Graph-Theoretic Concepts in Computer Science (WG '05), Volume 3787 of LNCS. Springer-Verlag, Berlin, 2005.
11. R. G. Downey. Parameterized complexity for the skeptic. In Proc. 18th IEEE Annual Conference on Computational Complexity (CCC '03), pages 147-169, 2003.
12. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, Berlin, 1999.
13. P. Erdós and L. Pósa. On the maximal number of disjoint circuits of a graph. Publicationes Mathematicae Debrecen, 9:3-12, 1962.
14. M. R. Fellows. Blow-ups, win/win's, and crown rules: some new directions in FPT. In Proc. 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '03), pages 1-12. Volume 2880 of LNCS. Springer-Verlag, Berlin, 2003.
15. M. R. Fellows. New directions and new challenges in algorithm design and complexity, parameterized. In Proc. 8th International Workshop on Algorithms and Data Structures (WADS '03), pages 505-520. Volume 2748 of LNCS. Springer-Verlag, Berlin, 2003.
16. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica, 39(4):321-347, 2004.
17. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Graph-modeled data clustering: fixed-parameter algorithms for clique generation. Theory of Computing Systems, 38(4):373-392, 2005.
18. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7(4):413-423, 1978.
19. T. Jiang, G. Lin, and J. Xu. On the closest tree kth root problem. Manuscript, Department of Computer Science, University of Waterloo, 2000.
20. H. Kaplan, R. Shamir, and R. E. Tarjan. Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM Journal on Computing, 28(5):1906-1922, 1999.
21. P. E. Kearney and D. G. Corneil. Tree powers. Journal of Algorithms, 29(1): 111-131, 1998.
22. M. Křivánek and J. Morávek. NP-hard problems in hierarchical-tree clustering. Acta Informatica, 23(3):311-323, 1986.
23. L. C. Lau. Bipartite roots of graphs. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA '04), pages 952-961. ACM/SIAM, New York/Philadelphia, PA, 2004.
24. L. C. Lau and D. G. Corneil. Recognizing powers of proper interval, split, and chordal graphs. SIAM Journal on Discrete Mathematics, 18(1):83-102, 2004.
25. J. M. Lewis and M. Yannakakis. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20(2):219-230, 1980.
26. G. Lin, P. E. Kearney, and T. Jiang. Phylogenetic k-root and Steiner k-root. In Proc. 11th Annual International Symposium on Algorithms and Computation (ISAAC '00), pages 539-551. Volume 1969 of LNCS. Springer-Verlag, Berlin, 2000.
27. Y. L. Lin and S. S. Skiena. Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics, 8(1):99-118, 1995.
28. R. Motwani and M. Sudan. Computing roots of graphs is hard. Discrete Applied Mathematics, 54(1):81-88, 1994.
29. A. Natanzon. Complexity and approximation of some graph modification problems. Master's thesis, Department of Computer Science, Tel Aviv University, 1999.
30. A. Natanzon, R. Shamir, and R. Sharan. Complexity classification of some edge modification problems. Discrete Applied Mathematics, 113:109-128, 2001.
31. R. Niedermeier. Ubiquitous parameterization - invitation to fixed-parameter algorithms. In Proc. 29th International Symposium on Mathematical Foundations of Computer Science (MFCS '04), pages 84-103. Volume 3153 of LNCS. Springer-Verlag, Berlin, 2004.
32. N. Nishimura, P. Ragde, and D. M. Thilikos. On graph powers for leaf-labeled trees. Journal of Algorithms, 42(1):69-108, 2002.
33. R. Peeters. The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics, 131(3):651-654, 2003.
34. V. Raman, S. Saurabh, and C. R. Subramanian. Faster fixed parameter tractable algorithms for undirected feedback vertex set. In Proc. 13th Annual International Symposium on Algorithms and Computation (ISAAC '02), pages 241-248. Volume 2518 of LNCS. Springer-Verlag, Berlin, 2002.
35. R. Shamir, R. Sharan, and D. Tsur. Cluster graph modification problems. Discrete Applied Mathematics, 144(1-2):173-182, 2004.
36. T. Tsukiji and Z.-Z. Chen. Computing phylogenetic roots with bounded degrees and errors is hard. In Proc. 10th International Computing and Combinatorics Conference (COCOON '04), pages 450-461. Volume 3106 of LNCS. Springer-Verlag, Berlin, 2004.