A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (Q2034399)
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 (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs |
scientific article; zbMATH DE number 7361598
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs |
scientific article; zbMATH DE number 7361598 |
Statements
A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs (English)
0 references
22 June 2021
0 references
bisection
0 references
fixed-parameter tractability
0 references
treewidth
0 references
