Constructive algorithm for path-width of matroids
DOI10.1137/1.9781611974331.CH116zbMATH Open1410.68377OpenAlexW3025751478MaRDI QIDQ4575700FDOQ4575700
Authors: Jisu Jeong, Eun Jung Kim, Sang-Il Oum 
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch116
Recommendations
- A simpler self-reduction algorithm for matroid path-width
- Finding branch-decompositions of matroids, hypergraphs, and more
- Finding branch-decompositions of matroids, hypergraphs, and more
- Matroid Pathwidth and Code Trellis Complexity
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial aspects of matroids and geometric lattices (05B35)
Cited In (20)
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
- A simpler self-reduction algorithm for matroid path-width
- A linear fixed parameter tractable algorithm for connected pathwidth
- Computing Tree Decompositions
- Edge-treewidth: algorithmic and combinatorial properties
- Title not available (Why is that?)
- Finding branch-decompositions of matroids, hypergraphs, and more
- Finding branch-decompositions of matroids, hypergraphs, and more
- Rank-width: algorithmic and structural results
- An augmenting path algorithm for linear matroid parity
- Covering Vectors by Spaces: Regular Matroids
- Matroid Pathwidth and Code Trellis Complexity
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- Computing paths of large rank in planar frameworks deterministically
- Title not available (Why is that?)
- On the optimality of pseudo-polynomial algorithms for integer programming
- On the optimality of pseudo-polynomial algorithms for integer programming
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
This page was built for publication: Constructive algorithm for path-width of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575700)
