A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph

Information Processing Letters

Volumn 111, Issue 11, 2011, Pages 508-511

  Berry, Anne ^a   Pogorelcnik, Romain ^a  

^a CNRS   (France)

Author keywords

Graph algorithms; LexBFS; Maximal clique; MCS; Minimal separator; Moplex ordering

Indexed keywords

GRAPH ALGORITHMS; LEXBFS; MAXIMAL CLIQUE; MCS; MINIMAL SEPARATOR; MOPLEX ORDERING;

SEPARATORS;

ALGORITHMS;

EID: 79952336964     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2011.02.013     Document Type: Article

References (11)

1. A. Berry Separability generalizes Diracs theorem Discrete Appl. Math. 84 1-3 1998 43 53
2. A. Berry, and J.-P. Bordat Moplex elimination orderings Electron. Notes Discrete Math. 8 2001 6 9
3. A. Berry, J.R.S. Blair, J.-P. Bordat, and G. Simonet Graph extremities defined by search algorithms Algorithms 3 2 2010 100 124 10.3390/a3020100
4. A. Berry, R. Krueger, and G. Simonet Maximal label search algorithms to compute perfect and minimal elimination orderings SIAM J. Discrete Math. 23 1 2009 428 446
5. J.R.S. Blair, and B.W. Peyton An introduction to chordal graphs and clique trees Graph Theory and Sparse Matrix Computation 84 1-3 1993 1 29
6. D.G. Corneil, and R. Krueger A unified view of graph searching SIAM J. Discrete Math. 22 4 2008 1259 1276
7. D.R. Fulkerson, and O.A. Gross Incidence matrices and interval graphs Pacific J. Math. 28 1969 565 570
8. P. Sreenivasa Kumar, and C.E. Veni Madhavan Minimal vertex separators of chordal graphs Discrete Appl. Math. 89 1-3 1998 155 168 (Pubitemid 128400159)
9. D.J. Rose Triangulated graphs and the elimination process J. Math. Anal. Appl. 32 3 1970 597 609
10. D.J. Rose, R.E. Tarjan, and G.S. Lueker Algorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 2 1976 266 283
11. R.E. Tarjan, and M. Yannakakis Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs SIAM J. Comput. 13 3 1984 566 579 (Pubitemid 15514404)