Error compensation in leaf root problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3341, Issue , 2004, Pages 389-401

  Dom, Michael ^a   Guo, Jiong ^a   Hüffner, Falk ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION; GRAPH THEORY; ERRORS;

ALGORITHMICS; EDGE MODIFICATION; ERRORS CORRECTION; FORBIDDEN SUBGRAPH CHARACTERIZATIONS; GRAPH POWER; LEAF ROOTS; NP COMPLETE; POWER PROBLEM; ROOT PROBLEMS; NP-COMPLETENESS;

ERROR COMPENSATION;

EID: 35048819037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_35     Document Type: Article

References (23)

1. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. In Proc. 43rd FOCS, pages 238-247. IEEE Computer Society, 2002.
2. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications, 1999.
3. L. Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58:171-176, 1996.
4. 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.
5. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:251-280, 1990.
6. M. R. Fellows. New directions and new challenges in algorithm design and complexity, parameterized. In Proc. 8th WADS, volume 2748 of LNCS, pages 505-520. Springer, 2003.
7. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. In Proc. 5th CIAC, volume 2653 of LNCS, pages 108-119. Springer, 2003. Long version to appear in Theory of Computing Systems.
8. 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.
9. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7(4):413-423, 1978.
10. T. Jiang, G. Lin, and J. Xu. On the closest tree kth root problem. Manuscript, Department of Computer Science, University of Waterloo, 2000.
11. 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.
12. P. E. Kearney and D. G. Corneil. Tree powers. Journal of Algorithms, 29(1):111-131, 1998.
13. M. Křivánek and J. Morávek. NP-hard problems in hierarchical-tree clustering. Acta Informatica, 23(3):311-323, 1986.
14. L. C. Lau. Bipartite roots of graphs. In Proc. 15th ACM-SIAM SODA, pages 952-961. ACM/SIAM, 2004.
15. 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.
16. G. Lin, P. E. Kearney, and T. Jiang. Phylogenetic k-root and Steiner k-root. In Proc. 11th ISAAC, volume 1969 of LNCS, pages 539-551. Springer, 2000.
17. Y. L. Lin and S. S. Skiena. Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics, 8(1):99-118, 1995.
18. R. Motwani and M. Sudan. Computing roots of graphs is hard. Discrete Applied Mathematics, 54(1):81-88, 1994.
19. A. Natanzon. Complexity and approximation of some graph modification problems. Master's thesis, Department of Computer Science, Tel Aviv University, 1999.
20. R. Niedermeier. Ubiquitous parameterization-invitation to fixed-parameter algorithms. In Proc. 29th MFCS, volume 3153 of LNCS, pages 84-103. Springer, 2004.
21. N. Nishimura, P. Ragde, and D. M. Thilikos. On graph powers for leaf-labeled trees. Journal of Algorithms, 42(1):69-108, 2002.
22. R. Peeters. The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics, 131(3):651-654, 2003.
23. R. Shamir, R. Sharan, and D. Tsur. Cluster graph modification problems. In Proc. 28th WG, volume 2573 of LNCS, pages 379-390. Springer, 2002. Long version to appear in Discrete Applied Mathematics.