A weighted matroid intersection algorithm
✍ Scribed by András Frank
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 415 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Intersecting Matroids by a Hyperplane We present an abstract matroid formulation of the geometric construction of intersecting the subspaces determined by a finite set of points of a projective space by a hyperplane containing a modular line spanned by two points of the set. It extends earlier
Efficient algorithms for the matroid intersection problem, both cardinality and weighted versions, are presented. The algorithm for weighted intersection works by scaling the weights. The cardinality algorithm is a special case, but takes advantage of greater structure. Efficiency of the algorithms
Wz give a new proof of a theorem of Bondy and Welsh. Our proof is simpler than previous ones in that it makes no use of Hall's theorem on tht: existence of a transversal of a family of sets.