Matroid Pathwidth and Code Trellis Complexity
From MaRDI portal
Publication:3614205
DOI10.1137/070691152zbMath1221.05032arXiv0705.1384OpenAlexW2035802809MaRDI QIDQ3614205
Publication date: 16 March 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.1384
Linear codes (general theory) (94B05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (14)
A Simpler Self-reduction Algorithm for Matroid Path-Width ⋮ Rank-width: algorithmic and structural results ⋮ Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ Seymour's conjecture on 2-connected graphs of large pathwidth ⋮ An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion ⋮ Outerplanar obstructions for matroid pathwidth ⋮ Branchwidth is \((1, g)\)-self-dual ⋮ Pathwidth vs Cocircumference ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ The “Art of Trellis Decoding” Is NP-Hard ⋮ Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm ⋮ Unnamed Item ⋮ Comparing linear width parameters for directed graphs ⋮ Tree Pivot-Minors and Linear Rank-Width
This page was built for publication: Matroid Pathwidth and Code Trellis Complexity
