The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
From MaRDI portal
Publication:4566553
DOI10.1109/TIT.2017.2740283zbMath1390.94926arXiv1507.02184OpenAlexW3099736943MaRDI QIDQ4566553
Sang-il Oum, Eun Jung Kim, Jisu Jeong
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.02184
Related Items (11)
A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth ⋮ 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 ⋮ Finding branch-decompositions of matroids, hypergraphs, and more ⋮ Unnamed Item ⋮ Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) ⋮ Typical sequences revisited -- computing width parameters of graphs ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ Finding Branch-Decompositions of Matroids, Hypergraphs, and More ⋮ Tree Pivot-Minors and Linear Rank-Width
This page was built for publication: The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
