Decomposition by clique separators
From MaRDI portal
Publication:1062072
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)- New applications of clique separator decomposition for the maximum weight stable set problem
- On stable cutsets in line graphs
- Triangulating graphs without asteroidal triples
- A description of claw-free perfect graphs
- 4‐Coloring P 6 ‐Free Graphs with No Induced 5‐Cycles
- scientific article; zbMATH DE number 970807 (Why is no real title available?)
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Fast Skew Partition Recognition
- Complexity of coloring graphs without paths and cycles
- Colouring perfect graphs with bounded clique number
- On Injective Colourings of Chordal Graphs
- Characterizing atoms that result from decomposition by clique separators
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Complexity aspects of the triangle path convexity
- Graphs of separability at most two: structural characterizations and their consequences
- Revisiting decomposition by clique separators
- Graphs of edge-intersecting and non-splitting paths
- Maximum weight independent sets in hole- and co-chair-free graphs
- Edge and vertex intersection of paths in a tree
- Weighted independent sets in a subclass of \(P_6\)-free graphs
- Maximum weight independent sets in classes related to claw-free graphs
- Minimal fill in O(\(n^{2.69}\)) time
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- On computing the Gromov hyperbolicity
- Safe separators for treewidth
- Graphs of separability at most 2
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- A refined analysis of online path coloring in trees
- Organizing the atoms of the clique separator decomposition into an atom tree
- Complexity results related to monophonic convexity
- Intersection graphs of paths in a tree
- Graph partitions with prescribed patterns
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Recursive conditioning
- An introduction to clique minimal separator decomposition
- On treewidth approximations.
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Obstructions to partitions of chordal graphs
- Simplicial decompositions of graphs: A survey of applications
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Colouring, constraint satisfaction, and complexity
- The Maximum Independent Set Problem in Planar Graphs
- Asymptotic bounds on the equilateral dimension of hypercubes
- List matrix partitions of chordal graphs
- Solving some NP-complete problems using split decomposition
- Strong cliques in diamond-free graphs
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- scientific article; zbMATH DE number 6093217 (Why is no real title available?)
- Representing edge intersection graphs of paths on degree 4 trees
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- Algorithms for maximum weight induced paths
- A class of three-colorable triangle-free graphs
- On the choosability of claw-free perfect graphs
- The edge intersection graphs of paths in a tree
- The complexity of path coloring and call scheduling
- Matrix partitions of perfect graphs
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- On distance-3 matchings and induced matchings
- Decomposition of a hypergraph by partial-edge separators
- On independent vertex sets in subclasses of apple-free graphs
- Strong cliques and equistability of EPT graphs
- Triangulating multitolerance graphs
- Graphs without large apples and the maximum weight independent set problem
- The \(k\)-edge intersection graphs of paths in a tree
- Resource allocation in bounded degree trees
- Maximum weight independent sets and cliques in intersection graphs of filaments
- The complexity of generalized clique covering
- Maximum weight independent sets in hole- and dart-free graphs
- Exploring gene causal interactions using an enhanced constraint-based method
- Weighted independent sets in classes of \(P_6\)-free graphs
- Optimal decomposition by clique separators
- 3-colouring AT-free graphs in polynomial time
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Separability generalizes Dirac's theorem
- On graphs with no induced subdivision of \(K_4\)
- Representing a concept lattice by a graph
- Two new characterizations of path graphs
- Optimal pricing of capacitated networks
- Classes of perfect graphs
- Conversion of coloring algorithms into maximum weight independent set algorithms
- Minimal disconnected cuts in planar graphs
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Fractional path coloring in bounded degree trees with applications
- Perfect graphs with polynomially computable kernels
- On coloring a class of claw-free and hole-twin-free graphs
- Decomposition by maxclique separators
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
- scientific article; zbMATH DE number 3890750 (Why is no real title available?)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- On the parameterized complexity of finding separators with non-hereditary properties
- On \(H\)-topological intersection graphs
- An implementation of the iterative proportional fitting procedure by propagation trees.
- Combinatorial problems on \(H\)-graphs
- Intersection graphs of vertex disjoint paths in a tree
- On chordal and perfect plane near-triangulations
- Complexity and polynomially solvable special cases of QUBO
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)
