A separator-based method for generating weakly chordal graphs

DOI10.1142/S1793830920500391zbMath1496.68268arXiv1906.01056MaRDI QIDQ5858151

Md. Zamilur Rahman, Asish Kumar Mukhopadhyay, Yash P. Aneja

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.01056

zbMATH Keywords

data structuresgraph algorithmsgraph generationweakly chordal graphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Generating weakly chordal graphs from arbitrary graphs ⋮ Algorithms for generating strongly chordal graphs

Cites Work

• Unnamed Item
• Weakly triangulated graphs
• Two methods for the generation of chordal graphs
• An efficient algorithm for finding a two-pair, and its applications
• Optimizing weakly triangulated graphs
• Algorithms for weakly triangulated graphs
• Incidence matrices and interval graphs
• Linear layouts of weakly triangulated graphs
• Improved algorithms for weakly chordal graphs
• Uniform generation of random regular graphs of moderate degree
• Generating Random Unlabelled Graphs
• Generating weakly triangulated graphs
• Linear-Time Generation of Random Chordal Graphs
• Generating random regular graphs

This page was built for publication: A separator-based method for generating weakly chordal graphs