Pages that link to "Item:Q967315"
From MaRDI portal
The following pages link to Computing branchwidth via efficient triangulations and blocks (Q967315):
Displaying 5 items.
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- Fast FPT-approximation of branchwidth (Q6083542) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
