Some recent results in matroid theory
- 311 Downloads
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 X ⊆ S independent in M i ?” could be answered by just one step.
KeywordsRank Function Maximum Match Submodular Function Polynomial Number Oriented Matroids
Unable to display preview. Download preview PDF.