Semi-dynamic algorithms for strongly chordal graphs

DOI10.1142/S179383092150049XMaRDI QIDQ5013507

Md. Zamilur Rahman, Asish Kumar Mukhopadhyay

Publication date: 30 November 2021

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

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

zbMATH Keywords

graph algorithmsstrongly chordal graphsalgorithm designsemi-dynamic algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
• Domination, independent domination, and duality in strongly chordal graphs
• Characterizations of strongly chordal graphs
• Fully dynamic algorithms for chordal graphs and split graphs

This page was built for publication: Semi-dynamic algorithms for strongly chordal graphs