- Greedy matroids
- found: Work cat.: Korte, B. Greedoids, 1991: CIP galley (greedy matroids; combinatorial structures which exhibit the classical matroid exchange property and the property of accessibility (every feasible set of cardinality k contains (at least) one feasible subset of cardinality k-1))
- found: CompuMath cit. index.
- notfound: LC data base, 6/20/91;James math. dict.;Encyc. dict. math.;Encyc. math.;Eisenreich. Mathematik
- 1991-06-22: new
The LC Linked Data Service welcomes any suggestions you might have about terminology used for a given heading or concept.
Would you like to suggest a change to this heading?
Please provide your name, email, and your suggestion so that we can begin assessing any terminology changes.
Fields denoted with an asterisk (*) are required.