Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
From MaRDI portal
(Redirected from Publication:805638)
Recommendations
- Dominating cliques in chordal graphs
- scientific article; zbMATH DE number 4045183
- Dominating cliques in graphs
- Dominating cliques in graphs
- An approximation algorithm for clustering graphs with dominating diametral path
- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Characterizing and computing the structure of clique intersections in strongly chordal graphs
- Exact algorithms for dominating clique problems (extended abstract)
- Domination using induced cliques in graphs
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4202309 (Why is no real title available?)
- scientific article; zbMATH DE number 3919840 (Why is no real title available?)
- scientific article; zbMATH DE number 4045183 (Why is no real title available?)
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- A recognition algorithm for the intersection graphs of paths in trees
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Clustering and domination in perfect graphs
- Dominating cliques in chordal graphs
- Dominating cliques in graphs
- Dominating sets in perfect graphs
- Intersection graphs of paths in a tree
- Interval graphs and related topics
- On domination problems for permutation and other graphs
- The NP-completeness column: An ongoing guide
- The NP-completeness column: An ongoing guide
- The NP-completeness column: an ongoing guide
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Three Partition Refinement Algorithms
Cited in
(18)- Dominating cliques in chordal graphs
- A note on \(r\)-dominating cliques
- Semicomplete absorbent sets in digraphs
- A linear-time algorithm for paired-domination problem in strongly chordal graphs
- Detecting strong cliques
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Dominating cliques in distance-hereditary graphs
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
- scientific article; zbMATH DE number 48751 (Why is no real title available?)
- Complexity of distance paired-domination problem in graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Minimum partition of an independence system into independent sets
- On connected dominating sets of restricted diameter
- Clique domination in graphs.
- A linear-time algorithm for semitotal domination in strongly chordal graphs
- scientific article; zbMATH DE number 4045183 (Why is no real title available?)
- \(r\)-dominating cliques in graphs with hypertree structure
- Revising Johnson's table for the 21st century
This page was built for publication: Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805638)
