Abstract
We would like to develop the basic machinery of greedoid theory. Some basic notions like rank, closure and (to a certain extent) minors can be introduced by extending the appropriate notions from matroids, while some others will be more specific for greedoids.
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
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Korte, B., Schrader, R., Lovász, L. (1991). Structural Properties. In: Greedoids. Algorithms and Combinatorics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58191-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-58191-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63499-4
Online ISBN: 978-3-642-58191-5
eBook Packages: Springer Book Archive