A fully dynamic algorithm for recognizing and representing chordal graphs
From MaRDI portal
Publication:3401970
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
Cited in
(8)- Fully dynamic recognition algorithm and certificate for directed cographs
- scientific article; zbMATH DE number 1305520 (Why is no real title available?)
- Fully dynamic recognition of proper circular-arc graphs
- Fully dynamic algorithm for recognition and modular decomposition of permutation 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)