Abstract
Many decomposition procedures (series-parallel decomposition, dismantling etc.) lead to languages that are not locally free, but possess a property close to this. Local freeness says that if at a certain point both x and y are feasible choices in the process, then so is x followed by y. The transposition property requires the same except when x and y are “twins” (i.e. whenever x occurs in the continuation of the process, it can be replaced by y and vice versa). While this property does not imply that the language is an antimatroid, it does imply that it is a greedoid. In fact, transposition greedoids form a proper superclass of interval 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). Transposition Greedoids. In: Greedoids. Algorithms and Combinatorics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58191-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-58191-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63499-4
Online ISBN: 978-3-642-58191-5
eBook Packages: Springer Book Archive