Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56475002, #quickstatements; #temporary_batch_1707303357582 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:13, 5 March 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
