𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inverse Matroid Intersection Problem

✍ Scribed by Cai Mao-Cheng; Yanjun Li

Publisher
Springer
Year
1997
Tongue
English
Weight
338 KB
Volume
45
Category
Article
ISSN
0340-9422

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Persistency and matroid intersection
Persistency and matroid intersection
✍ D. Magos; I. Mourtos; L. Pitsoulis πŸ“‚ Article πŸ“… 2007 πŸ› Springer-Verlag 🌐 English βš– 436 KB
The base-matroid and inverse combinatori
The base-matroid and inverse combinatorial optimization problems
✍ Mauro Dell'Amico; Francesco Maffioli; Federico Malucelli πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 196 KB

A new matroid is introduced: this matroid is deΓΏned starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has appli

Efficient Theoretic and Practical Algori
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
✍ Harold N. Gabow; Ying Xu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 754 KB

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

Intersecting Matroids by a Hyperplane
Intersecting Matroids by a Hyperplane
✍ JiΕ™Δ±́ TΕ―ma πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 267 KB

## 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