The following pages link to Structural properties of greedoids (Q594882):
Displaying 25 items.
- Matroids and antimatroids - a survey (Q757382) (← links)
- An intersection theorem for supermatroids (Q803140) (← links)
- Chip-firing games on graphs (Q805639) (← links)
- A note on selectors and greedoids (Q1061744) (← links)
- Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes (Q1069309) (← links)
- Non-interval greedoids and the transposition property (Q1079572) (← links)
- Linear objective functions on certain classes of greedoids (Q1082346) (← links)
- Greedoid polyhedra (Q1097283) (← links)
- Homotopy properties of greedoids (Q1101115) (← links)
- A characterization of undirected branching greedoids (Q1103626) (← links)
- Homomorphisms and Ramsey properties of antimatroids (Q1104331) (← links)
- A circuit set characterization of antimatroids (Q1112050) (← links)
- Branchings in rooted graphs and the diameter of greedoids (Q1118604) (← links)
- Greedoids and searches in directed graphs (Q1182876) (← links)
- Minor characterization of undirected branching greedoids -- a short proof (Q1813731) (← links)
- Exchange systems (Q1823954) (← links)
- Secretary problem: graphs, matroids and greedoids (Q2068844) (← links)
- Coordinatization of finite join-distributive lattices. (Q2249406) (← links)
- Polymatroid greedoids (Q2266020) (← links)
- The intersection of matroids and antimatroids (Q2277465) (← links)
- On topological watersheds (Q2573031) (← links)
- Greedoids and Linear Objective Functions (Q3323971) (← links)
- Cohen-Macaulay binomial edge ideals of small graphs (Q6066476) (← links)
- Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid (Q6135742) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
