A fast algorithm to construct a representation for transversal matroids
From MaRDI portal
Publication:263073
DOI10.1007/s13160-016-0209-9zbMath1333.05068OpenAlexW2294850962MaRDI QIDQ263073
Morteza Esmaeili, Morteza Rekab-Eslami, 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
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding all the perfect matchings in bipartite graphs
- On the complexity of computing determinants
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Transversals and matroid partition
- On the Vector Representation of Matroids
- Depth-First Search and Linear Graph Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: A fast algorithm to construct a representation for transversal matroids