Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.05.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W311575298 / rank | |||
Normal rank | |||
Revision as of 18:04, 19 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
