On generating strong elimination orderings of strongly chordal graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1530 LNCS, Issue , 1998, Pages 221-232

  Prasad, N Kalyana Rama ^a   Kumar, P Sreenivasa ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; CHORDAL GRAPHS; LEXICOGRAPHIC BREADTH FIRST SEARCH; SIMPLE ALGORITHM; STRONGLY CHORDAL GRAPH; TIME COMPLEXITY; UNDIRECTED GRAPH; VERTEX SEPARATORS;

ALGORITHMS; SOFTWARE ENGINEERING;

GRAPH THEORY;

EID: 34648857321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_20     Document Type: Conference Paper

References (15)

1. C Beeri, R Fagin, D Maier and M Yannakakis, On the desirability of acyclic database schemes, Jl. of ACM, 30, 1983, pp: 479-513. 221
2. R Fagin, Degrees of Acyclicity for hypergraph and relational database schemes, Jl. of ACM, 30, 1983, pp: 514-550. 221 (Pubitemid 13573333)
3. M Farber, Characterization of Strongly Chordal Graphs, Discrete Math., 43, 1983, pp: 173-189. 221, 223
4. M Farber and R P Anstee Characterization of Totally Balanced Matrices, Jl. of Algorithms, 5, 1984, pp: 215-230. 221
5. M Farber, Domination, Independent Domination and Duality in Strongly Chordal Graphs, Discrete Applied Mathematics, 7, 1884, pp: 115-130. 221
6. M C Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980. 222
7. Jeno Lehel, A characterization of totally balanced matrices, Discrete Mathematics, 57, 1985, pp: 59-65. 221
8. Anna Lubiw, Double Lexical Ordering of matrices, SIAM Jl. of Computing, 16(5), Oct 1987, pp: 854-879. 221, 231
9. Shen-Lung Peng and Maw-Shang Chang, A simple linear-time algorithm for the domatic prtition problem on strongly chordal graphs, Information processing Letters, 43, 1992, pp: 297-300. 221
10. D J Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in "R C Reed (ed.), Graph Theory and Computing, Academic Press, 1972", pp: 183-217. 221
11. D J Rose, R E Tarjan and G S Lueker, Algorithmic Aspects of Vertex Elimination on Graphs, SIAM Jl. of Computing, 5, 1976, pp: 266-283. 223
12. J P Spinrad, Doubly Lexical Ordering of Dense 0-1 Matrices, Information Processing Letters, 45, 1993, pp: 229-235. 221
13. P Sreenivasa Kumar and C E Veni Madhavan, 2-Separator Chordal Graphs, Proceedings of National Seminar on Theoretical Computer Science, Kharagpur, India, 1993, pp: 37-52. 224, 225
14. R E Tarjan and R Paige, Three Partition Refinement Algorithm , SIAM Jl. Computing, 16, 1987, pp: 973-989. 221
15. M Yannakakis and R E Tarjan , Simple Linear-time Algorithms to Test Chordality of Graphs, Test acyclicity of Hypergraphs and Selectively Reduce Acyclic Hypergraphs, SIAM Jl. Computing, 13(3), 1984, pp: 565-579. 224