Pages that link to "Item:Q5013567"
From MaRDI portal
The following pages link to Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567):
Displaying 7 items.
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
- Finding Branch-Decompositions and Rank-Decompositions (Q5900367) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)
- Fast FPT-approximation of branchwidth (Q6593764) (← links)
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)