Fully dynamic algorithm for chordal graphs with \(O(1)\) query-time and \(O(n^2)\) update-time (Q442287): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68R10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68P05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6064621 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
chordal graphs | |||
| Property / zbMATH Keywords: chordal graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dynamic algorithms | |||
| Property / zbMATH Keywords: dynamic algorithms / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimal triangulations | |||
| Property / zbMATH Keywords: minimal triangulations / rank | |||
Normal rank | |||
Revision as of 01:20, 30 June 2023
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
