Some recent results in matroid theory

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


All the matroid algorithms presented so far (in Sections 7.4 and 13.1) were polynomial in the sense that the total number of operations was proportional to a polynomial of the size n of the input (usually n was the cardinality of the underlying set S of the matroids M 1, M 2, ... in question), supposing that questions like “Is XS independent in M i ?” could be answered by just one step.


Rank Function Maximum Match Submodular Function Polynomial Number Oriented Matroids 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


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