Efficient Algorithms for Finding a Core of a Tree with a Specified Length

Journal of Algorithms

Volumn 20, Issue 3, 1996, Pages 445-458

  Peng, Shietung ^a   Lo, Win Tsung ^b  

^a UNIVERSITY OF AIZU   (Japan)

^b FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

GRAPH PATH; SEQUENTIAL ALGORITHM;

PARALLEL ALGORITHMS;

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

References (9)

1. R. J. Anderson and G. L. Miller, "Deterministic Parallel List Ranking," Aegean Workshop on Computing, 1988.
2. R. Cole and U. Vishkin, Approximate Parallel Scheduling, Part 1: The basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput. 17 (1988) 128-142.
3. A. J. Goldman, Optimum center location in simple networks, Transport. Sci. 5 (1971) 212-221.
4. S. L. Hakimi, Optimal distribution of switching centers in a communication networks and some related graph theoretical problems, Oper. Res. 13 (1965), 462-475.
5. E. Minieka, The optimal location of a path or tree in a tree network, Networks 15 (1985), 309-321.
6. E. Minieka and N. H. Patel, On finding the core of a tree with a specified length, J. Algorithms 4 (1983) 345-352.
7. B. C. Tansel, R. L. Francis, and T. J. Lowe, Location on networks: A survey, Management Sci. 29 (1983), 482-511.
8. R. E. Tarjan and U. Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel time, in "Proc. 25th Annual Symp. on Foundations of Comp. Science, 1984, pp. 12-22.
9. U. Vishkin, "Synchronous Parallel Computation - A Survey," TR. 71, Department of Computer Science, Courant Institute, NYU, 1983.