论文信息 - Linear Algorithms on Recursive Representations of Trees

Linear Algorithms on Recursive Representations of Trees

A recursive labeling of a tree T with M vertices is any assignment of the labels 1, 2,…, M to the vertices of T which has the property that every vertex, except the vertex labeled ‘1’ is adjacent to exactly one vertex with a smaller label. A corresponding recursive representation of T is the array C(2), C(3),…, C(M), where C(i) is the unique vertex adjacent to i having a smaller label. In this paper we discuss the feasibility, advantages and relative efficiency of using this representation to design algorithms on trees.

[1] S. Mitchell,et al. Algorithms on trees and maximal outerplanar graphs: design, complexity analysis, and data structures study. , 1977 .

[2] Robert E. Tarjan,et al. b-Matchings in Trees , 1976, SIAM J. Comput..

[3] A. Meir,et al. Cutting down recursive trees , 1974 .

[4] Aaron Kershenbaum,et al. Recursive analysis of network reliability , 1973, Networks.

[5] E. H. Neville,et al. The codifying of tree-structure , 1953, Mathematical Proceedings of the Cambridge Philosophical Society.

[6] Donald J. ROSE,et al. On simple characterizations of k-trees , 1974, Discret. Math..

[7] Stephen T. Hedetniemi,et al. A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[8] J. Moon,et al. Combinatorics: The distance between nodes in recursive trees , 1974 .

[9] Robert E. Tarjan,et al. Optimal Chain Partitions of Trees , 1975, Inf. Process. Lett..

[10] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[11] J. Hopcroft,et al. Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[12] J. Hopcroft,et al. Efficient algorithms for graph manipulation , 1971 .

[13] Ronald C. Read,et al. THE CODING OF VARIOUS KINDS OF UNLABELED TREES , 1972 .

[14] Fanica Gavril,et al. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..