Generating weakly chordal graphs from arbitrary graphs

DOI10.1007/978-3-662-66491-9_4zbMath1528.68304arXiv2003.13786OpenAlexW3014386945MaRDI QIDQ6111462

Sudiksha Khanduja, Asish Kumar Mukhopadhyay, Md. Zamilur Rahman, Aayushi Srivastava

Publication date: 3 August 2023

Published in: Transactions on Computational Science XXXIX (Search for Journal in Brave)

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

zbMATH Keywords

weakly chordal graphminimum triangulationweak triangulation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakly triangulated graphs
• Optimizing weakly triangulated graphs
• Algorithms for weakly triangulated graphs
• Reconfiguration graph for vertex colourings of weakly chordal graphs
• Treewidth and Minimum Fill-in: Grouping the Minimal Separators
• Linear layouts of weakly triangulated graphs
• Improved algorithms for weakly chordal graphs
• Cataloguing the graphs on 10 vertices
• The Evolution of the Minimum Degree Ordering Algorithm
• Computing the Minimum Fill-In is NP-Complete
• A separator-based method for generating weakly chordal graphs

This page was built for publication: Generating weakly chordal graphs from arbitrary graphs