An efficient algorithm to compute the toughness in graphs with bounded treewidth (Q6616440)
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: An efficient algorithm to compute the toughness in graphs with bounded treewidth |
scientific article; zbMATH DE number 7923968
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm to compute the toughness in graphs with bounded treewidth |
scientific article; zbMATH DE number 7923968 |
Statements
An efficient algorithm to compute the toughness in graphs with bounded treewidth (English)
0 references
9 October 2024
0 references
tougness
0 references
fixed-parameter tractable
0 references
treewidth
0 references
