Decomposition by clique separators

[1]  Clyde L. Monma,et al.  Intersection graphs of paths in a tree , 1986, J. Comb. Theory, Ser. B.

[2]  Martin Charles Golumbic,et al.  Edge and vertex intersection of paths in a tree , 1985, Discret. Math..

[3]  Martin Charles Golumbic,et al.  The edge intersection graphs of paths in a tree , 1985, J. Comb. Theory, Ser. B.

[4]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[5]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[6]  M. Yannakakis.  Computing the Minimum Fill-in is NP^Complete , 1981 .

[7]  Sue Whitesides,et al.  An Algorithm for Finding Clique Cut-Sets , 1981, Inf. Process. Lett..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[10]  Fanica Gavril,et al.  Algorithms on clique separable graphs , 1977, Discret. Math..

[11]  T. Ohtsuki,et al.  Minimal triangulation of a graph and optimal pivoting order in a sparse matrix , 1976 .

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

[13]  Philippe G. H. Lehot.  An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph , 1974, JACM.

[14]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[15]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[16]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[17]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[18]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[19]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[20]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

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

[22]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[23]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

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

[25]  C. Shannon.  A Theorem on Coloring the Lines of a Network , 1949 .