A fast algorithm to construct a representation for transversal matroids
From MaRDI portal
(Redirected from Publication:263073)
Recommendations
- Linear representation of transversal matroids and gammoids parameterized by rank
- Linear representation of transversal matroids and gammoids parameterized by rank
- scientific article; zbMATH DE number 1555984
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- Determining when a graphic matroid is transversal in linear time
Cites work
- scientific article; zbMATH DE number 682203 (Why is no real title available?)
- scientific article; zbMATH DE number 1104328 (Why is no real title available?)
- scientific article; zbMATH DE number 2081005 (Why is no real title available?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Depth-First Search and Linear Graph Algorithms
- Finding all the perfect matchings in bipartite graphs
- On the Vector Representation of Matroids
- On the complexity of computing determinants
- Transversals and matroid partition
- Triangular Factorization and Inversion by Fast Matrix Multiplication
Cited in
(6)- Linear representation of transversal matroids and gammoids parameterized by rank
- A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
- Determining when a graphic matroid is transversal in linear time
- The maximum representation of fuzzy transversal matroids
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- Linear representation of transversal matroids and gammoids parameterized by rank
This page was built for publication: A fast algorithm to construct a representation for transversal matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263073)
