# 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} }

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

#### Topics from this paper.

2 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 15 REFERENCES

Branch-width, parse trees, and monadic second-order logic for matroids

- Computer Science, Mathematics
- 2006

43

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

- Mathematics, Computer Science
- 1996

294