论文信息 - A recognition algorithm for the intersection graphs of directed paths in directed trees

A recognition algorithm for the intersection graphs of directed paths in directed trees

Consider a finite family of non-empty sets. The intersection graph of this family is obtained by representing each set by a vertex, two vertices being connected by an edge if and only if the corresponding sets intersect. The intersection graph of a family of directed paths in a directed tree is called a directed path graph. In this paper we present an efficient algorithm which constructs to a given graph a representation by a family of directed paths on a directed tree, if one exists. Also, we prove that a graph is a proper directed path graph if and only if it is a directed path graph.

Fanica Gavril | F. Gavril

[1] A. Lempel,et al. Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[2] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[3] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .

[4] P. Renz. Intersection representations of graphs by arcs. , 1970 .

[5] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[6] A. Tucker,et al. Matrix characterizations of circular-arc graphs , 1971 .

[7] 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..

[8] D. Rose. Triangulated graphs and the elimination process , 1970 .

[9] V. Klee. What Are the Intersection Graphs of Arcs in a Circle , 1969 .

[10] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .