Advertisement

The sum of matroids II

  • András Recski
Chapter
  • 308 Downloads
Part of the Algorithms and Combinatorics book series (AC, volume 6)

Abstract

For all the applications in Chapter 12 we needed quick algorithm for the matroid partition problem: Given the matroids M 1 = (S, F 1), M 2 = (S, F 2), ..., M k = =(S, F k ) with respective rank functions r 1, r 2, ..., r k , and given a subset XS. One should decide whether X is independent in the sum \({\text{N = V}}_{i = 1}^k {\text{M}}_i\) of the matroids.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • András Recski
    • 1
  1. 1.Eötvös Loránd UniversityBudapest VIIIHungary

Personalised recommendations