On Generating Strong Elimination Orderings of Strongly Chordal Graphs

Authors:
N. Kalyana Rama Prasad;P. Sreenivasa Kumar
Affiliations:
-;-
Venue:
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
1998

Citing 0
Cited 2

Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On colorings of squares of outerplanar graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract