Pages that link to "Item:Q4575700"
From MaRDI portal
The following pages link to Constructive algorithm for path-width of matroids (Q4575700):
Displaying 17 items.
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- An FPT 2-approximation for tree-cut decomposition (Q1702123) (← links)
- Rank-width: algorithmic and structural results (Q2403788) (← links)
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion (Q2408197) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Covering Vectors by Spaces: Regular Matroids (Q4555045) (← links)
- A Simpler Self-reduction Algorithm for Matroid Path-Width (Q4569568) (← links)
- Finding branch-decompositions of matroids, hypergraphs, and more (Q5002759) (← links)
- On the Optimality of Pseudo-polynomial Algorithms for Integer Programming (Q5009590) (← links)
- Finding Branch-Decompositions of Matroids, Hypergraphs, and More (Q5013567) (← links)
- (Q5028484) (← links)
- Computing Tree Decompositions (Q5042458) (← links)
- A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth (Q5062107) (← links)
- (Q5874536) (← links)
- Edge-treewidth: algorithmic and combinatorial properties (Q6069149) (← links)