A combinatorial optimization algorithm for solving the branchwidth problem (Q429498)
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: A combinatorial optimization algorithm for solving the branchwidth problem |
scientific article; zbMATH DE number 6048081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial optimization algorithm for solving the branchwidth problem |
scientific article; zbMATH DE number 6048081 |
Statements
A combinatorial optimization algorithm for solving the branchwidth problem (English)
0 references
19 June 2012
0 references
branch decomposition
0 references
branchwidth
0 references
implicit enumeration
0 references
partitioning
0 references
0.8243105411529541
0 references
0.8180550932884216
0 references
0.8165445327758789
0 references
0.8132526278495789
0 references
