Decomposition by clique separators
- 1 July 1985
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 55 (2) , 221-232
- https://doi.org/10.1016/0012-365x(85)90051-2
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Edge and vertex intersection of paths in a treeDiscrete Mathematics, 1985
- The edge intersection graphs of paths in a treeJournal of Combinatorial Theory, Series B, 1985
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- Algorithms on clique separable graphsDiscrete Mathematics, 1977
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrixJournal of Mathematical Analysis and Applications, 1976
- An Optimal Algorithm to Detect a Line Graph and Output Its Root GraphJournal of the ACM, 1974
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961