On Generating Strong Elimination Orderings of Strongly Chordal Graphs
We present a conceptually simple algorithm to generate an ordering of the vertices of an undirected graph. The ordering generated turns out to be a strong elimination ordering if and only if the given graph is a strongly chordal graph. This algorithm makes use of maximum cardinality search and lexicographic breadth first search algorithms which are used to generate perfect elimination orderings of a chordal graph. Our algorithm takes O(k 2 n) time where k is the size of the largest minimal vertex separator and n denotes the number vertices in the graph. The algorithm provides a new insight into the structure of strongly chordal graphs and also gives rise to a new algorithm of the same time complexity for recognition of strongly chordal graphs.
KeywordsEdge Weight Chordal Graph Perfect Graph High Label Separator Size
Unable to display preview. Download preview PDF.
- 10.Rose, D.J.: A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In: Reed, R.C. (ed.) Graph Theory and Computing, pp. 183–217. Academic Press, London (1972)Google Scholar
- 13.Sreenivasa Kumar, P., Veni Madhavan, C.E.: 2-Separator Chordal Graphs. In: Proceedings of National Seminar on Theoretical Computer Science, Kharagpur, India, pp. 37–52 (1993)Google Scholar