Algorithms for generating strongly chordal graphs

DOI10.1007/978-3-662-63170-6_4MaRDI QIDQ2233439zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph algorithmschordal graphsstrongly chordal graphsgraph generation

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Linear-time generation of random chordal graphs
• Generation of random chordal graphs using subtrees of a tree
• scientific article; zbMATH DE number 1302027
• Two methods for the generation of chordal graphs
• Strengthening strongly chordal graphs

Cites work

• scientific article; zbMATH DE number 1185294 (Why is no real title available?)
• A characterization of strongly chordal graphs
• A new characterization of strongly chordal graphs
• A separator-based method for generating weakly chordal graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithmic graph theory and perfect graphs
• Characterizations of strongly chordal graphs
• Domination, independent domination, and duality in strongly chordal graphs
• Linear-time generation of random chordal graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Two methods for the generation of chordal graphs
• \(k\)-tuple domination in graphs

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)