Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271)
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: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs |
scientific article; zbMATH DE number 6033757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs |
scientific article; zbMATH DE number 6033757 |
Statements
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (English)
0 references
11 May 2012
0 references
split decomposition
0 references
distance hereditary graphs
0 references
fully dynamic algorithms
0 references
0 references
0 references
0 references
0.8615086078643799
0 references
0.8061493635177612
0 references
0.8026195764541626
0 references
0.7908682823181152
0 references
0.7906745076179504
0 references
