Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Recski, A. (1989). Some recent results in matroid theory. In: Matroid Theory and its Applications in Electric Network Theory and in Statics. Algorithms and Combinatorics, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-22143-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-662-22143-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-22145-7
Online ISBN: 978-3-662-22143-3
eBook Packages: Springer Book Archive