Pages that link to "Item:Q429498"
From MaRDI portal
The following pages link to A combinatorial optimization algorithm for solving the branchwidth problem (Q429498):
Displaying 9 items.
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- A branch-and-branch algorithm for solving the group technology problem (Q922271) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Tour merging via branch-decomposition (Q2884557) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- (Q4724430) (← links)
- Recent Advances in Constraints (Q5899109) (← links)
- Tangle bases: Revisited (Q6087071) (← links)