Tree Powers
- 1 October 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 29 (1), 111-131
- https://doi.org/10.1006/jagm.1998.9999
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Complexity and algorithms for reasoning about timeJournal of the ACM, 1993
- Distances in cocomparability graphs and their powersDiscrete Applied Mathematics, 1992
- NP-hard problems in hierarchical-tree clusteringActa Informatica, 1986
- Totally-Balanced and Greedy MatricesSIAM Journal on Algebraic Discrete Methods, 1985
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Powers of chordal graphsJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1983
- On powers and centers of chordal graphsDiscrete Applied Mathematics, 1983
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Characterization of n-path graphs and of graphs having nth rootJournal of Combinatorial Theory, Series B, 1974
- The square root of a digraphJournal of Combinatorial Theory, 1968