Doubly chordal graphs, steiner trees, and connected domination
From MaRDI portal
Publication:5285479
DOI10.1002/net.3230230108zbMath0771.05076OpenAlexW2020808467MaRDI QIDQ5285479
Publication date: 29 June 1993
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230230108
Trees (05C05) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (20)
\(r\)-dominating cliques in graphs with hypertree structure ⋮ Making a dominating set of a graph connected ⋮ Incidence graphs of biacyclic hypergraphs ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ The \(k\)-hop connected dominating set problem: approximation and hardness ⋮ Dually chordal graphs ⋮ Cosecure domination: hardness results and algorithms ⋮ Some new algorithmic results on co-secure domination in graphs ⋮ Variations of maximum-clique transversal sets on graphs ⋮ Computing a minimum outer-connected dominating set for the class of chordal graphs ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ Signed clique-transversal functions in graphs ⋮ On the complexity of signed and minus total domination in graphs ⋮ 2-edge connected dominating sets and 2-connected dominating sets of a graph ⋮ Algorithmic aspects of secure connected domination in graphs ⋮ Algorithmic aspects of 2-secure domination in graphs ⋮ Connected Domination ⋮ Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph ⋮ Intersection graphs of maximal hypercubes
Cites Work
This page was built for publication: Doubly chordal graphs, steiner trees, and connected domination
