An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (Q3590946): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_30 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1738403920 / rank | |||
Normal rank | |||
Latest revision as of 20:24, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs |
scientific article |
Statements
An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (English)
0 references
3 September 2007
0 references
dynamic algorithm
0 references
graph recognition
0 references
distance-hereditary
0 references
cograph
0 references
