A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (Q831866)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7497778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm to compute the connected treewidth of a series-parallel graph |
scientific article; zbMATH DE number 7497778 |
Statements
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph (English)
0 references
24 March 2022
0 references
graph decompositions
0 references
graph classes
0 references
width parameters
0 references
combinatorial algorithms
0 references
series-parallel graphs
0 references
treewidth
0 references
connected treewidth
0 references
dynamic programming
0 references
0 references
0 references
0.8556402325630188
0 references
0.8030538558959961
0 references
0.7974917888641357
0 references
0.7967129349708557
0 references
0.7895671129226685
0 references
