Tree Powers

Journal of Algorithms

Volumn 29, Issue 1, 1998, Pages 111-131

  Kearney, Paul E ^a   Corneil, Derek G ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (21)

1. R. P. Anstee and M. Farber, Characterizations of totally balanced matrices, J. Algorithms 5 (1984), 215-230.
2. R. Balakrishnan and P. Paulraja, Powers of chordal graphs, Austral. J. Math. Ser. A 35 (1983), 211-217.
3. P. Damaschke, Distances in cocomparability graphs and their powers, Discrete Appl. Math. 35 (1992), 67-72.
4. F. Escalante, L. Montejano, and T. Rojano, Characterization of n-path graphs and of graphs having nth root, J. Combin. Theory Ser. B 16 (1974), 282-289.
5. M. Farber, Characterizations of strongly chordal graphs, Discrete Math. 43 (1983), 173-189.
6. M. R. Garey and D. S. Johnson, "Computers and Intractibility: A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
7. D. P. Geller, The square root of a digraph, J. Combin. Theory Ser. B 5 (1968), 320-321.
8. M. C. Golumbic, H. Kaplan, and R. Shamir, "On the Complexity of DNA Physical Mapping," Technical Report 271-293, Computer Science Dept., Tel Aviv University, 1993 (to appear in Adv. in Appl. Math.).
9. M. C. Golumbic and R. Shamir, Complexity and algorithms for reasoning about time: A graph-theoretical approach, J. Assoc. Comput. Mach. 40 (1993), 1108-1133.
10. T. Hamada, Graphs which are n-th powers of trees, Sci. Univ. Tokyo J. Math. 15-1 (1979).
11. A. J. Hoffman, A. W. J. Kolen, and M. Sakarovitch, Totally-balanced and greedy matrices, SIAM J. Alg. Disc. Math. 6 (1985), 721-730.
12. M. Křivánek and J. Morávek, NP-hard problems in hierarchical-tree clustering, Acta Inform. 23 (1986), 311-323.
13. R. Laskar and D. Shier, On powers and centers of chordal graphs, Discrete Appl. Math. 6 (1983), 139-147.
14. H. T. Lau, "Finding a Hamiltonian Cycle in the Square of a Block," Ph.D. thesis, School of Computer Science, McGill University, Montreal, 1980.
15. Y.-L. Lin and S. S. Skiena, Algorithms for square roots of graphs, SIAM J. Discrete Math. 8 (1995), 99-118.
16. N. Linial, Locality in distributed graph algorithms, SIAM J. Comput. 21 (1992), 193-201.
17. A. Lubiw, "Γ-Free Matrices," M.S. thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, 1982.
18. R. Motwani and M. Sudan, Computing roots of graphs is hard, Discrete Appl. Math. 54 (1994), 81-88.
19. A. Mukhopadhyay, The square root of a graph, J. Combin. Theory Ser. B 2 (1967), 290-295.
20. A. Raychaudhuri, On powers of interval and unit interval graphs, Congr. Numer. 59 (1987), 235-242.
21. A. Raychaudhuri, On powers of strongly chordal and circular arc graphs, Ars Combin. 34 (1992), 147-160.