A combinatorial optimization algorithm for solving the branchwidth problem (Q429498): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10589-011-9397-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10589-011-9397-Z / rank | |||
Normal rank | |||
Latest revision as of 17:18, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial optimization algorithm for solving the branchwidth problem |
scientific article |
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
