Greedoids |
Contents
Introduction | 1 |
Representations of Antimatroids | 19 |
General Exchange Structures Greedoids | 45 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
A₁ accessible set system assume B₁ B₂ balanced interval greedoid basic word basis bisimplicial C₁ characterization classes of greedoids closed under union closure feasible closure operator Consider contains contradicting Conversely convex geometry convex hull convex sets Corollary critical circuit define denote directed graph edge equivalent example exchange property exists an element feasible sets feasible subset feasible words Gauss greedoid Gaussian elimination greedy algorithm ground set Hence hereditary language homotopy ideal implies independence system induction intersection interval greedoid interval property k-connected Korte and Lovász Lemma linear maximal element minimal monotone nodes optimal ordered geometry ordered set partial order partially ordered set path polymatroid greedoid poset antimatroid poset greedoid Proof r(X U rank feasible sets rank function root satisfies Section semimodular lattice set system simplicial submodular Suppose Theorem undirected branching greedoid unique vector vertex X₁ Y₁