On graph powers for leaf-labeled trees

Journal of Algorithms

Volumn 42, Issue 1, 2002, Pages 69-108

  Nishimura, Naomi ^a   Radge, Prabhakar ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Graph power; Leaf power; Phylogenetic tree; Tree power

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; POLYNOMIALS; THEOREM PROVING;

GRAPH POWERS; LEAF LABELED TREES; PHYLOGENETIC TREE; TREE POWER;

TREES (MATHEMATICS);

EID: 0036462110     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2001.1195     Document Type: Article

References (11)

1. J.-P. Barthélemy and A. Guénoche "Trees and Proximity Representations," Wiley, New York, 1991.
2. D. G. Corneil and P. Kearney, Tree powers, J. Algorithms 29 (1998). 111-131.
3. R. Gavril, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set for chordal graphs, SIAM J. Comput. 1 (1972), 180-187.
4. M. R. Henzinger, V. King, and T. Warnow, Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology, Algorithmica 24 (1999), 1-13.
5. D. H. Huson, K. A. Smith, and T. Warnow, Estimating large distances in phylogenetic reconstruction, in "Proceedings of the 3rd International Workshop on Algorithm Engineering," Lecture Notes in Computer-Science, Vol. 1668, pp. 270-285, 1999.
6. P.E. Kearney "The Relationship between a Phylogeny and Its Ordinal Assertions," Technical Report 308/97, University of Toronto, Department of Computer Science, 1997.
7. J. Kim and T. Warnow, "Tutorial on Phylogenetic Tree Estimation," manuscript, Department of Ecology and Evolutionary Biology, Yale University, http://ismb99/gmd.de/TUTORIALS/Kim/4KimTutorial.ps, 1999.
8. N. Linial Locality in distributed graph algorithms, SIAM J. Comput. 21 (1992), 193-201.
9. R. Motwani and M. Sudan, Computing roots of graphs is hard, Discrete Appl. Mathe. 54 (1994), 81-88.
10. D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput. 5 (1976), 266-283.
11. R. E. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984), 566-579.