Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2012.05.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2012.05.002 / rank | |||
Normal rank | |||
Latest revision as of 17:46, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time |
scientific article |
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
