Abstract
In this paper, we present the clique arrangement A(G) for a chordal graph G to describe the intersections between the maximal cliques of G more precisely than in clique trees or related concepts. In particular, the node set of A(G) consists of all intersections of maximal cliques of G. In A(G), there is an arc from a node X to a node Z, if X is a subset of Z and there is no node Y, that is a superset of X and a subset of Z. We provide a new characterization of strongly chordal graphs in terms of forbidden cyclic structures in the corresponding clique arrangements and we show how to compute the clique arrangement of a strongly chordal graph efficiently. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Nevries, R., & Rosenke, C. (2013). Characterizing and computing the structure of clique intersections in strongly chordal graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8165 LNCS, pp. 382–393). Springer Verlag. https://doi.org/10.1007/978-3-642-45043-3_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
