The clique-separator graph for chordal graphs
From MaRDI portal
(Redirected from Publication:1026133)
Recommendations
- scientific article; zbMATH DE number 5778727
- scientific article; zbMATH DE number 4134082
- A Separator Theorem for Chordal Graphs
- Clique Partitions of Chordal Graphs
- scientific article; zbMATH DE number 1047750
- Clique Graphs of Chordal and Path Graphs
- Clique graph characterizations of strongly chordal graphs
- Clique vectors of \(k\)-connected chordal graphs
- Edge clique graphs and some classes of chordal graphs
- scientific article; zbMATH DE number 4134090
Cites work
- scientific article; zbMATH DE number 3851152 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 1303554 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- A Fully dynamic algorithm for recognizing and representing proper interval graphs
- A characterisation of rigid circuit graphs
- Algorithmic graph theory and perfect graphs
- Algorithms and Computation
- Counting clique trees and computing perfect elimination schemes in parallel
- Graph Classes: A Survey
- Incidence matrices and interval graphs
- Intersection graphs of paths in a tree
- On rigid circuit graphs
- On the tree representation of chordal graphs
- Power of Natural Semijoins
- Representations of chordal graphs as subtrees of a tree
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The NP-completeness column: an ongoing guide
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Topics in Intersection Graph Theory
Cited in
(27)- Finding a maximum-weight convex set in a chordal graph
- An efficient representation of chordal graphs
- An efficient algorithm for counting Markov equivalent DAGs
- Component-cardinality-constrained critical node problem in graphs
- On the tree representation of chordal graphs
- Separator theorems for interval graphs and proper interval graphs
- Intersection graphs of non-crossing paths
- A unified framework for bi(tri)connectivity and chordal augmentation
- Computing role assignments of proper interval graphs in polynomial time
- scientific article; zbMATH DE number 4134082 (Why is no real title available?)
- Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)
- A new representation of proper interval graphs with an application to clique-width
- Cage-amalgamation graphs, a common generalization of chordal and median graphs
- Clique partitioning with value-monotone submodular cost
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- A fully dynamic graph algorithm for recognizing interval graphs
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- Graphs that have separator tree representations
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
- Edge clique graphs and some classes of chordal graphs
- Resource allocation with time intervals
- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Computing the clique-separator graph for an interval graph in linear time
- A simple algorithm to find Hamiltonian cycles in proper interval graphs
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Computing role assignments of proper interval graphs in polynomial time
This page was built for publication: The clique-separator graph for chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026133)
