Simpler Self-reduction Algorithm for Matroid Path-width

@inproceedings{Hlinveny2016SimplerSA,
  title={Simpler Self-reduction Algorithm for Matroid Path-width},
  author={Petr Hlinven'y},
  year={2016}
}
  • Petr Hlinven'y
  • Published 2016
  • Computer Science
  • Path-width of matroids naturally generalizes better known path-width of graphs, and is NP-hard by a reduction from the graph case. While the term matroid path-width was formally introduced by Geelen–Gerards–Whittle [JCTB 2006] in pure matroid theory, it was soon recognized by Kashyap [SIDMA 2008] that it is the same concept as long-studied so called trellis complexity in coding theory, later named trellis-width, and hence it is an interesting notion also from the algorithmic perspective. It… CONTINUE READING
    Rank-width: Algorithmic and structural results
    25
    The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
    6

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 15 REFERENCES
    A Parametrized Algorithm for Matroid Branch-Width
    48
    Matroid Pathwidth and Code Trellis Complexity
    31
    Branch-width, parse trees, and monadic second-order logic for matroids
    43
    Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
    103
    Constructive algorithm for path-width of matroids
    19
    Linear Layouts in Submodular Systems
    18
    On Matroid Properties Definable in the MSO Logic
    27
    Outerplanar obstructions for matroid pathwidth
    11