A Simpler Self-reduction Algorithm for Matroid Path-Width
From MaRDI portal
Publication:4569568
DOI10.1137/17M1120129zbMath1390.05040arXiv1605.09520MaRDI QIDQ4569568
Publication date: 25 June 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.09520
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Decoding (94B35)
Cites Work
- Unnamed Item
- Outerplanar obstructions for matroid pathwidth
- Graph minors. I. Excluding a forest
- On the excluded minors for the matroids of branch-width \(k\)
- Branch-width and well-quasi-ordering in matroids and graphs.
- Branch-width, parse trees, and monadic second-order logic for matroids.
- On Rota's conjecture and excluded minors containing large projective geometries.
- Matroid Pathwidth and Code Trellis Complexity
- Te "art of trellis decoding" is computationally hard-for large fields
- The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
- Constructive algorithm for path-width of matroids
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Linear Layouts in Submodular Systems
- Mathematical Foundations of Computer Science 2003
- A Parametrized Algorithm for Matroid Branch-Width
- Finding Branch-Decompositions and Rank-Decompositions
