A combinatorial optimization algorithm for solving the branchwidth problem (Q429498): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6048081 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branch decomposition | |||
| Property / zbMATH Keywords: branch decomposition / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
branchwidth | |||
| Property / zbMATH Keywords: branchwidth / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
implicit enumeration | |||
| Property / zbMATH Keywords: implicit enumeration / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
partitioning | |||
| Property / zbMATH Keywords: partitioning / rank | |||
Normal rank | |||
Revision as of 23:33, 29 June 2023
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
