Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:16, 5 March 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
