Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3513839 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4116559 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- A Separator Theorem for Planar Graphs
- A Theorem on Coloring the Lines of a Network
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Algorithms on clique separable graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- An algorithm for finding clique cut-sets
- Computing the Minimum Fill-In is NP-Complete
- Depth-First Search and Linear Graph Algorithms
- Dividing a Graph into Triconnected Components
- Edge and vertex intersection of paths in a tree
- Incidence matrices and interval graphs
- Linear-time computability of combinatorial problems on series-parallel graphs
- Maximum matching and a polyhedron with 0,1-vertices
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- On rigid circuit graphs
- The NP-Completeness of Edge-Coloring
- The edge intersection graphs of paths in a tree
- Triangulated graphs and the elimination process
Cited in
(only showing first 100 items - show all)- On Injective Colourings of Chordal Graphs
- scientific article; zbMATH DE number 4016952 (Why is no real title available?)
- Recursive conditioning
- Approximation of knapsack problems with conflict and forcing graphs
- Maximum weight independent sets in hole- and co-chair-free graphs
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- A linear algorithm for the group path problem on chordal graphs
- Strong cliques and equistability of EPT graphs
- On independent vertex sets in subclasses of apple-free graphs
- On graphs with no induced subdivision of \(K_4\)
- Matrix partitions of perfect graphs
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
- Graph partitions with prescribed patterns
- Routing and path multicoloring
- Join colourings of chordal graphs
- Structural submodularity and tangles in abstract separation systems
- Colouring square-free graphs without long induced paths
- Solving larger maximum clique problems using parallel quantum annealing
- Organizing the atoms of the clique separator decomposition into an atom tree
- Bisimplicial separators
- A new algorithm for decomposition of graphical models
- Graphs without large apples and the maximum weight independent set problem
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- scientific article; zbMATH DE number 6093217 (Why is no real title available?)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- Treewidth versus clique number. II: Tree-independence number
- Trees of tangles in abstract separation systems
- On asteroidal sets in chordal graphs
- Representing a concept lattice by a graph
- The Maximum Independent Set Problem in Planar Graphs
- Graphs of separability at most 2
- Combinatorial problems on \(H\)-graphs
- On the structure of (even hole, kite)-free graphs
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
- Colouring, constraint satisfaction, and complexity
- The edge intersection graphs of paths in a tree
- Complexity aspects of the triangle path convexity
- Minimal fill in O(\(n^{2.69}\)) time
- Safe separators for treewidth
- Strong cliques in diamond-free graphs
- A tight approximation algorithm for the cluster vertex deletion problem
- A tight approximation algorithm for the cluster vertex deletion problem
- The complexity of path coloring and call scheduling
- A refined analysis of online path coloring in trees
- The clique minimal separator decomposition of a hypergraph
- Edge and vertex intersection of paths in a tree
- Intersection graphs of paths in a tree
- Structure and algorithms for (cap, even hole)-free graphs
- scientific article; zbMATH DE number 7743715 (Why is no real title available?)
- Listing subgraphs by Cartesian decomposition
- On \(H\)-topological intersection graphs
- Conversion of coloring algorithms into maximum weight independent set algorithms
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs
- Graphs of edge-intersecting and non-splitting paths
- Cuts, matrix completions and graph rigidity
- On CLIQUE Problem for Sparse Graphs of Large Dimension
- Combining decomposition approaches for the maximum weight stable set problem
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
- On the choosability of claw-free perfect graphs
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Weighted independent sets in classes of \(P_6\)-free graphs
- Decomposition by maxclique separators
- Clique roots of \(K_4\)-free chordal graphs
- A coloring algorithm for \(4 K_1\)-free line graphs
- Separability generalizes Dirac's theorem
- Maximum weight independent sets in classes related to claw-free graphs
- On stable cutsets in line graphs
- Triangulating graphs without asteroidal triples
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Criteria of decomposability of Post clones
- Decomposition of a hypergraph by partial-edge separators
- Matrix Partitions with Finitely Many Obstructions
- Complexity results related to monophonic convexity
- An introduction to clique minimal separator decomposition
- Two new characterizations of path graphs
- Complexity and polynomially solvable special cases of QUBO
- Disjoint clique cutsets in graphs without long holes
- The intersection of two vertex coloring problems
- Maximum weight independent sets in hole- and dart-free graphs
- Colouring square-free graphs without long induced paths
- 3-colouring AT-free graphs in polynomial time
- Walrasian equilibrium: Hardness, approximations and tractable instances
- Coloring rings
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with 5-vertex prohibitions
- Exploring gene causal interactions using an enhanced constraint-based method
- Revisiting decomposition by clique separators
- New applications of clique separator decomposition for the maximum weight stable set problem
- Structure of some \(( P_7, C_4)\)-free graphs with application to colorings
- Weighted independent sets in a subclass of P₆-free graphs
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Solving some NP-complete problems using split decomposition
- Graphs of separability at most two: structural characterizations and their consequences
- Applying clique-decomposition for computing Gromov hyperbolicity
This page was built for publication: Decomposition by clique separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062072)
