Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:42, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs |
scientific article |
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
