A fully dynamic algorithm for recognizing and representing chordal graphs

DOI10.1007/978-3-540-70881-0_44zbMATH Open1185.68501OpenAlexW1544171126MaRDI QIDQ3401970FDOQ3401970

Authors: Tursunbay Kyzy Yrysgul 

Publication date: 2 February 2010

Published in: Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70881-0_44

Recommendations

• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
• scientific article; zbMATH DE number 1305520
• Algorithms and Computation
• A fully dynamic algorithm for modular decomposition and recognition of cographs.
• Fully dynamic algorithms for chordal graphs and split graphs

Mathematics Subject Classification ID

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

Cited In (8)

• Fully dynamic recognition algorithm and certificate for directed cographs
• Title not available (Why is that?)
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
• Fully dynamic recognition of proper circular-arc graphs
• A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
• Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
• Algorithms and Computation
• A fully dynamic graph algorithm for recognizing interval graphs

This page was built for publication: A fully dynamic algorithm for recognizing and representing chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401970)