A Linear Time Algorithm for Finding a k-Tree Core

Journal of Algorithms

Volumn 23, Issue 2, 1997, Pages 281-290

  Shioura, Akiyoshi ^a   Uno, Takeaki ^a  

^a Tokyo Institute of Technology ^*  (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (7)

1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to Algorithms," MIT Press, Cambridge, MA, 1990.
2. S. L. Hakimi, Optimum location of switching centers and the absolute centers and medians of a graph, Oper. Res. 12 (1964), 450-459.
3. E. Minieka and N. H. Patel, On finding the core of a tree with a specified length, J. Algorithms 4 (1983), 345-352.
4. E. Minieka, The optimal location of a path or tree in a tree network, Networks 15(3) (1985), 309-321.
5. C. A. Morgan and P. J. Slater, A linear algorithm for a core of a tree, J. Algorithms 1 (1980), 247-258.
6. S. Peng, A. B. Stephens, and Y. Yesha, Algorithms for a core and k-tree core of a tree, J. Algorithms 15 (1993), 143-159.
7. A. B. Stephens, Y. Yesha, and K. Humenik, Optimal allocation for partially replicated database systems on tree-based networks, working paper.