MathematicsComputer Science

Polynomial Algorithms—Matroids

R. Parker, R. Rardin

1988Discrete Optimization

DOI: 10.1016/b978-0-12-545075-1.50008-0

tlooto Summary

This chapter presents an algorithm for the problem of determining a maximum cardinality intersection of two matroids, a primal-dual one because the underlying matroid concept of duality subsumes many dualities for special cases.

Abstract

Abstract is not available.

Citation format

PARKER, R.; RARDIN, R. Polynomial algorithms—matroids. Discrete Optimization, 1988: 57–106.