A fast algorithm to construct a representation for transversal matroids
DOI10.1007/S13160-016-0209-9zbMATH Open1333.05068OpenAlexW2294850962MaRDI QIDQ263073FDOQ263073
Authors: Morteza Rekab-Eslami, Morteza Esmaeili, T. Aaron Gulliver 
Publication date: 4 April 2016
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13160-016-0209-9
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
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- Finding all the perfect matchings in bipartite graphs
- On the complexity of computing determinants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Title not available (Why is that?)
- Transversals and matroid partition
- On the Vector Representation of Matroids
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Cited In (6)
- The maximum representation of fuzzy transversal matroids
- A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- Linear representation of transversal matroids and gammoids parameterized by rank
- Linear representation of transversal matroids and gammoids parameterized by rank
- Determining when a graphic matroid is transversal in linear time
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)
