Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (Q895993)
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: Canonical tree-decompositions of finite graphs. I: Existence and algorithms. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Canonical tree-decompositions of finite graphs. I: Existence and algorithms. |
scientific article |
Statements
Canonical tree-decompositions of finite graphs. I: Existence and algorithms. (English)
0 references
11 December 2015
0 references
connectivity
0 references
tree-decomposition
0 references
\(k\)-block
0 references
tangle
0 references
profile
0 references
Tutte decomposition
0 references
0.9127799272537231
0 references
0.8338553309440613
0 references
0.8158692121505737
0 references
0.8156948685646057
0 references
0.8060917258262634
0 references
