Abstract
In the first part of this paper, a new structure for chordal graph is introduced, namely the clique graph. This structure is shown to be optimal with regard to the set of clique trees. The greedy aspect of the recognition algorithms of chordal graphs is studied. A new greedy algorithm that generalizes both Maximal cardinality Search (MCS) and Lexicographic Breadth first search is presented. The trace of an execution of MCS is defined and used in two linear time and space algorithms: one builds a clique tree of a chordal graph and the other is a simple recognition procedure of chordal graphs.
Cite
CITATION STYLE
Galinier, P., Habib, M., & Paul, C. (1995). Chordal graphs and their clique graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1017, pp. 358–371). Springer Verlag. https://doi.org/10.1007/3-540-60618-1_88
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
