- the
greedoid to
further generalize this
characterization of
greedy algorithms;
hence the name
greedoid.
Besides mathematical optimization,
greedoids have...
- and
their vertices (sets of size 1). In the
context of
matroids and
greedoids,
abstract simplicial complexes are also
called independence systems. An...
- 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...
- 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...
-
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...
- de Janeiro. Korte, Bernhard; Lovász, László; Schrader,
Rainer (1991),
Greedoids,
Algorithms and Combinatorics, vol. 4, Springer-Verlag, ISBN 3-540-18190-3...
-
antiexchange axiom Coxeter matroid – Group-theoretic
generalization of
matroids Greedoid – Set
system used in
greedy optimization Oriented matroid – Abstraction...
- of
finite sets
Factor graph –
Function graph representing factorization Greedoid – Set
system used in
greedy optimization Incidence structure – Abstract...
- Bron–Kerbosch
algorithm Listing all
elements of
structures such as
matroids and
greedoids Several problems on graphs, e.g.,
enumerating independent sets, paths...
