Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
From MaRDI portal
(Redirected from Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n^2) update-time)
Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
