An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (Q3590946)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs |
scientific article; zbMATH DE number 5186522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs |
scientific article; zbMATH DE number 5186522 |
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
0.89050084
0 references
0.8891927
0 references
0.8831887
0 references
0.87570643
0 references
0.8709422
0 references
0.86712056
0 references
