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)- Decomposition by maxclique separators
- Resource allocation in bounded degree trees
- The complexity of generalized clique covering
- On new algorithmic techniques for the weighted vertex coloring problem
- Clique‐width: Harnessing the power of atoms
- A description of claw-free perfect graphs
- A new characterization of unichord-free graphs
- All roads lead to Rome -- new search methods for the optimal triangulation problem
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- Fractional path coloring in bounded degree trees with applications
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
- On decomposability of multilinear sets
- Computing a clique tree with the algorithm maximal label search
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree
- Interval graphs and related topics
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- On chordal and perfect plane near-triangulations
- Characterizing atoms that result from decomposition by clique separators
- The maximum infection time in the geodesic and monophonic convexities
- Dichotomy for tree-structured trigraph list homomorphism problems
- Algorithms for maximum weight induced paths
- Triangulating multitolerance graphs
- Representing edge intersection graphs of paths on degree 4 trees
- Maximum colorful independent sets in vertex-colored graphs
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Clique or hole in claw-free graphs
- Classes of perfect graphs
- Some properties of graph centroids
- Simplicial decompositions of graphs: A survey of applications
- scientific article; zbMATH DE number 970807 (Why is no real title available?)
- Complexity of coloring graphs without paths and cycles
- Colouring perfect graphs with bounded clique number
- Minimum fill-in of sparse graphs: kernelization and approximation
- On distance-3 matchings and induced matchings
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring
- Fast Skew Partition Recognition
- The (theta, wheel)-free graphs. IV: Induced paths and cycles
- Parameterized complexity of path set packing
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel
- Perfect graphs with polynomially computable kernels
- Optimal decomposition by clique separators
- On treewidth approximations.
- Clique cutsets beyond chordal graphs
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Intersection graphs of vertex disjoint paths in a tree
- On the maximum cardinality cut problem in proper interval graphs and related graph classes
- On distance-3 matchings and induced matchings
- On the parameterized complexity of finding separators with non-hereditary properties
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Two classes of graphs in which some problems related to convexity are efficiently solvable
- 4‐Coloring P 6 ‐Free Graphs with No Induced 5‐Cycles
- Decomposability of abstract and path-induced convexities in hypergraphs
- Junction trees of general graphs
- Helly EPT graphs on bounded degree trees: characterization and recognition
- Attachment centrality: measure for connectivity in networks
- Finding cut-vertices in the square roots of a graph
- The \(k\)-edge intersection graphs of paths in a tree
- Asymptotic bounds on the equilateral dimension of hypercubes
- Minimum weighted clique cover on claw‐free perfect graphs
- Two complexity results for the vertex coloring problem
- Evaluating Datalog via tree automata and cycluits
- Counting weighted independent sets beyond the permanent
- Finding the minimal set for collapsible graphical models
- On the structure of (pan, even hole)-free graphs
- scientific article; zbMATH DE number 3890750 (Why is no real title available?)
- Optimal pricing of capacitated networks
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- A class of three-colorable triangle-free graphs
- Inapproximability and approximability of minimal tree routing and coloring
- Bounds for cell entries in contingency tables given marginal totals and decomposable graphs
- Obstructions to partitions of chordal graphs
- Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions
- Independent Sets in Classes Related to Chair-Free Graphs
- Characteristic properties and recognition of graphs in which geodesic and monophonic convexities are equivalent
- Some results on the Gaussian Markov random field construction problem based on the use of invariant subgraphs
- On stable cutsets in claw-free graphs and planar graphs
- An implementation of the iterative proportional fitting procedure by propagation trees.
- On computing the Gromov hyperbolicity
- Sums of squares and sparse semidefinite programming
- On coloring a class of claw-free and hole-twin-free graphs
- A note on lexicographic breadth first search for chordal graphs
- Minimal disconnected cuts in planar graphs
- List matrix partitions of chordal graphs
- Finding induced paths of given parity in claw-free graphs
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
- Representations of graphs and networks (coding, layouts and embeddings)
- Tree-decompositions with bags of small diameter
- 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
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)
