论文信息 - Moplex orderings generated by the LexDFS algorithm

Moplex orderings generated by the LexDFS algorithm

Let G be a graph with vertex set V. A moplex of G is both a clique and a module whose neighborhood is a minimal separator in G or empty. A moplex ordering of G is an ordered partition (X"1,X"2,...,X"k) of V for some integer k into moplexes which are defined in the successive transitory elimination graphs, i.e., for 1=

[1] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[2] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..

[3] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .

[4] G. Dirac. On rigid circuit graphs , 1961 .

[5] Derek G. Corneil,et al. A Unified View of Graph Searching , 2008, SIAM J. Discret. Math..

[6] Anne Berry,et al. Separability Generalizes Dirac's Theorem , 1998, Discret. Appl. Math..

[7] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[8] Jean R. S. Blair,et al. Graph Extremities Defined by Search Algorithms , 2010, Algorithms.

[9] B. Peyton,et al. An Introduction to Chordal Graphs and Clique Trees , 1993 .

[10] Barry W. Peyton,et al. On Finding Minimum-Diameter Clique Trees , 1994, Nord. J. Comput..

[11] Anne Berry,et al. A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph , 2011, Inf. Process. Lett..