Constructive algorithm for path-width of matroids

@inproceedings{Jeong2016ConstructiveAF,
  title={Constructive algorithm for path-width of matroids},
  author={Jisu Jeong and Eun Jung Kim and Sang-il Oum},
  booktitle={SODA},
  year={2016}
}
Given n subspaces of a finite-dimensional vector space over a fixed finite field F, we wish to find a linear layout V1, V2, . . . , Vn of the subspaces such that dim((V1+V2+· · ·+Vi)∩(Vi+1+· · ·+Vn)) ≤ k for all i; such a linear layout is said to have width at most k. When restricted to 1-dimensional subspaces, this problem is equivalent to computing the path-width of an F-represented matroid in matroid theory and computing the trellis-width (or minimum trellis state-complexity) of a linear… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 37 references

Graph minors. I

  • N. Robertson, P. Seymour
  • Excluding a forest. J. Combin. Theory Ser. B,
  • 1983
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…