- the
greedoid to
further generalize this
characterization of
greedy algorithms;
hence the name
greedoid.
Besides mathematical optimization,
greedoids have...
- Dijkstra's algorithm, a very
similar algorithm for the
shortest path
problem Greedoids offer a
general way to
understand the
correctness of Prim's algorithm...
- and
their vertices (sets of size 1). In the
context of
matroids and
greedoids,
abstract simplicial complexes are also
called independence systems. An...
- a
maximal linearly independent subset Rank of a free
module Rank of a
greedoid, the
maximal size of a
feasible set Rank of a group, the
smallest cardinality...
-
inclusion relation).
Other examples of set
families are
independence systems,
greedoids, antimatroids, and
bornological spaces.
Algebra of sets –
Identities and...
- Springer-Verlag. Björner, Anders; Ziegler, Günter M. (1992), "Introduction to
greedoids", in White, Neil (ed.),
Matroid Applications,
Encyclopedia of Mathematics...
-
which their name derives.
Antimatroids can be
viewed as a
special case of
greedoids and of
semimodular lattices, and as a
generalization of
partial orders...
-
orderings or sets
Coxeter matroid – Group-theoretic
generalization of
matroids Greedoid – Set
system used in
greedy optimization Oriented matroid – Abstraction...
-
combinatorics Lovász
conjecture Geometry of
numbers Perfect graph theorem Greedoid Bell
number Lovász
number Graph limit Lovász
local lemma "Curriculum Vitae"...
- parent. So the
maximum in-degree is
equal to 1. Gordon, Gary (1989). "A
greedoid polynomial which distinguishes rooted arborescences".
Proceedings of the...
