Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n^2) update-time |
scientific article; zbMATH DE number 6064621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time |
scientific article; zbMATH DE number 6064621 |
Statements
Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (English)
0 references
10 August 2012
0 references
chordal graphs
0 references
dynamic algorithms
0 references
minimal triangulations
0 references
0 references
0.8947626352310181
0 references
0.884403645992279
0 references
0.8693726658821106
0 references
0.8555587530136108
0 references
