Back to search

Decomposition by clique separators

Data up to Jan 2025

Published1985
Citations432
References27

Total Citations Per Year

Abstract

References (27)

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

The Design and Analysis of Computer Algorithms

1974 • 9,688 citations

Depth-First Search and Linear Graph Algorithms

1972 • 5,699 citations

Flows in networks

1962 • 4,199 citations

Graphs and Hypergraphs

1973 • 3,161 citations

Maximum matching and a polyhedron with 0,1-vertices

1965 • 1,719 citations

A Separator Theorem for Planar Graphs

1979 • 1,381 citations

Incidence matrices and interval graphs

1965 • 1,286 citations

Algorithmic Aspects of Vertex Elimination on Graphs

1976 • 1,224 citations

The NP-Completeness of Edge-Coloring

1981 • 1,135 citations

On rigid circuit graphs

1961 • 936 citations

Dividing a Graph into Triconnected Components

1973 • 851 citations

Computing the Minimum Fill-In is NP-Complete

1981 • 705 citations

Graph Theory and Computing

1972 • 607 citations

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

1972 • 536 citations

Triangulated graphs and the elimination process

1970 • 496 citations

A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS

1972 • 434 citations

A Theorem on Coloring the Lines of a Network

1949 • 296 citations

Linear-time computability of combinatorial problems on series-parallel graphs

1982 • 289 citations

An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph

1974 • 180 citations

The edge intersection graphs of paths in a tree

1985 • 142 citations

Intersection graphs of paths in a tree

1986 • 140 citations

SOME POLYNOMIAL ALGORITHMS FOR CERTAIN GRAPHS AND HYPERGRAPHS.

1976 • 124 citations

An algorithm for finding clique cut-sets

1981 • 98 citations

Edge and vertex intersection of paths in a tree

1985 • 79 citations

Minimal triangulation of a graph and optimal pivoting order in a sparse matrix

1976 • 68 citations

Algorithms on clique separable graphs

1977 • 47 citations

Cited By (0)

Loading...