Decomposition by clique separators

Discrete Mathematics

Volumn 55, Issue 2, 1985, Pages 221-232

  Tarjan, Robert E ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000455611     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(85)90051-2     Document Type: Article

References (27)

1. On rigid circuit graphs
2. Maximum matching and a polyhedron with 0,1-vertices
3. Some polynomial algorithms for certain graphs and hypergraphs
4. Incidence matrices and interval graphs
5. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
6. Algorithms on clique separable graphs
7. Edge and vertex intersection of paths in trees
8. Dividing a Graph into Triconnected Components
9. The NP-Completeness of Edge-Coloring
10. An optimal algorithm to detect a line graph and output its root graph
11. A separator theorem for planar graphs
12. Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
13. Triangulated graphs and the elimination process
14. a graph-theoretic study of the numerical solution of sparse positive definitive systems of linear equations
15. Algorithmic Aspects of Vertex Elimination on Graphs
16. A theorem on coloring the lines of a network
17. Linear-time computability of combinatorial problems on series-parallel graphs
18. Depth-First Search and Linear Graph Algorithms
19. On an estimate of the chromatic class of a p-graph (in Russian)
20. An algorithm for finding clique cut-sets
21. Computing the Minimum Fill-In is NP-Complete