Finding cores of limited length

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1272, Issue , 1997, Pages 45-54

  Alstrup, Stephen ^a   Lauridsen, Peter W ^a   Sommerlund, Peer ^a   Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DATA STRUCTURES;

LINEAR-TIME ALGORITHMS;

FORESTRY;

EID: 84947934762     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_47     Document Type: Conference Paper

References (15)

1. S. Alstrup, P.W. Lauridsen, P. Sommerlund, and M. Thorup. Finding cores of limited length. Technical report, Department of Computer Science, University of Copenhagen, 1997. See also http://www.diku.dk/ stephen/newpapers.html.
2. H. Davenport and A. Schinzel. A combinatorial problem connected with differential equations. Amer. J. Math., 87:684-694, 1965.
3. A.J. Goldman. Optimal center location in simple networks. Transportation Sci., 5:212-221, 1971.
4. S.L. Hakimi, M. Labbé, and E.F. Schmeichel. On locating path-or tree-shaped facilities on networks. Networks, 23:543-555, 1993.
5. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors. Siam J. Comput, 13(2):338-355, 1984.
6. S. Hart and M. Sharir. Nonlinearity of davenport-schinzel sequences and of general path compression schemes. Combinatorica, 6:151-177, 1986.
7. W. Lo and S. Peng. An optimal parallel algorithm for a core of a tree. In International conference on Parallel processing, pages 326-329, 1992.
8. W. Lo and S. Peng. Efficient algorithms for finding a. core of a tree with a specified length. J. Algorithms, 20:445-458, 1996.
9. K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. EATCS. Springer, 1 edition, 1984.
10. E. Minieka. The optimal location of a path or tree in a tree network. Networks, 15:309-321, 1985.
11. E. Minieka and N.H. Patel. On finding the core of a tree with a specified length. J. Algorithms, 4:345-352, 1983.
12. C.A. Morgan and P. J. Slater. A linear algorithm for a core of a tree. J. Algorithms, 1:247-258, 1980.
13. S. Peng, A.B. Stephens, and Y. Yesha. Algorithms for a core and k-tree core of a tree. J. Algorithms, 15:143-159, 1993.
14. P.J. Slater. Locating central paths in a graph. Transportation Sci., 16:1-18, 1982.
15. A. Wiernik. Planar realizations of nonlinear davenport-schinzel sequences by segments. In Foundations of Computer Science, pages 97-106, 1986.