Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2011.05.007 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2011.05.007 / rank | |||
Normal rank | |||
Revision as of 01:14, 9 December 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
0 references
0 references
0 references
