Algorithms for generating strongly chordal graphs
From MaRDI portal
Publication:2233439
DOI10.1007/978-3-662-63170-6_4zbMATH Open1473.68126OpenAlexW3159453235MaRDI QIDQ2233439FDOQ2233439
Authors: Md. Zamilur Rahman, Asish Mukhopadhyay
Publication date: 18 October 2021
Full work available at URL: https://doi.org/10.1007/978-3-662-63170-6_4
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Algorithmic graph theory and perfect graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Characterizations of strongly chordal graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Domination, independent domination, and duality in strongly chordal graphs
- \(k\)-tuple domination in graphs
- A characterization of strongly chordal graphs
- Linear-time generation of random chordal graphs
- Two methods for the generation of chordal graphs
- A new characterization of strongly chordal graphs
- A separator-based method for generating weakly chordal graphs
- Title not available (Why is that?)
Cited In (6)
- Strengthening strongly chordal graphs
- Regular vines with strongly chordal pattern of (conditional) independence
- Improved algorithms for weakly chordal graphs
- Generating weakly chordal graphs from arbitrary graphs
- Linear-time generation of random chordal graphs
- Two methods for the generation of chordal graphs
This page was built for publication: Algorithms for generating strongly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233439)