Finding all common bases in two matroids

DOI10.1016/0166-218X(94)00088-UzbMath0823.05020MaRDI QIDQ1842654

Komei Fukuda, Makoto Namiki

Publication date: 23 October 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmbipartite graphenumerationmatroidsperfect matchingscommon basispivot operation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Criss-cross methods: A fresh view on pivot algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Crashing a maximum-weight complementary basis
• Matroid basis graphs. I
• Matroid basis graphs. II
• Matroid Intersection
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Finding all minimum-cost perfect matchings in Bipartite graphs
• Matroid intersection algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Theory of Matroids

This page was built for publication: Finding all common bases in two matroids