The following pages link to Greedoids (Q810029):
Displaying 50 items.
- A discrete duality between nonmonotonic consequence relations and convex geometries (Q2183103) (← links)
- Subspace Procrustes analysis (Q2193526) (← links)
- The Bhargava greedoid (Q2199839) (← links)
- Optimizing phylogenetic diversity under constraints (Q2210035) (← links)
- New polyhedral and algorithmic results on greedoids (Q2220660) (← links)
- Impartial achievement games on convex geometries (Q2230406) (← links)
- Choice resolutions (Q2235096) (← links)
- Coordinatization of finite join-distributive lattices. (Q2249406) (← links)
- Polymatroid greedoids (Q2266020) (← links)
- Interaction indices for games on combinatorial structures with forbidden coalitions (Q2275631) (← links)
- The intersection of matroids and antimatroids (Q2277465) (← links)
- Violator spaces vs closure spaces (Q2311366) (← links)
- Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm (Q2312659) (← links)
- Dual greedy polyhedra, choice functions, and abstract convex geometries (Q2386212) (← links)
- A representation of antimatroids by Horn rules and its application to educational systems (Q2403022) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- Antimatroids and balanced pairs (Q2454046) (← links)
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (Q2462380) (← links)
- Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid (Q2469975) (← links)
- Quasi-concave functions on meet-semilattices (Q2473045) (← links)
- The max-flow min-cut property of two-dimensional affine convex geometries (Q2477392) (← links)
- Enumeration in convex geometries and associated polytopal subdivisions of spheres (Q2482198) (← links)
- Mathematics of Plott choice functions (Q2486161) (← links)
- Characterizations of polygreedoids and poly-antimatroids by greedy algorithms (Q2488235) (← links)
- Oracles for vertex elimination orderings (Q2566003) (← links)
- The chip-firing game (Q2575794) (← links)
- A characteristic polynomial for rooted mixed graphs (Q2576845) (← links)
- On unicyclic graphs with uniquely restricted maximum matchings (Q2637732) (← links)
- Knowledge spaces from a topological point of view (Q2654145) (← links)
- Resolutions of convex geometries (Q2665967) (← links)
- Tropical Carathéodory with matroids (Q2679600) (← links)
- Reconfiguring (non-spanning) arborescences (Q2680989) (← links)
- When bad things happen to good trees (Q2744569) (← links)
- Distributive lattice polyhedra (Q2851507) (← links)
- Antimatroids, Betweenness, Convexity (Q2971604) (← links)
- Finding a Maximum-Weight Convex Set in a Chordal Graph (Q3121516) (← links)
- Polyhedral results for antimatroids (Q3211313) (← links)
- Greedoids and Linear Objective Functions (Q3323971) (← links)
- Greedoids - A structural framework for the greedy algorithm (Q3338268) (← links)
- Unicycle graphs and uniquely restricted maximum matchings (Q3439344) (← links)
- A Geometric Characterization of Poly-antimatroids (Q3439605) (← links)
- Examples and algorithmic properties of greedoids (Q3470255) (← links)
- The Erdos-Szekeres problem on points in convex position – a survey (Q4501063) (← links)
- Tabling with Sound Answer Subsumption (Q4593070) (← links)
- (Q4827544) (← links)
- A greedy algorithm for dropping digits (Q5020906) (← links)
- Networks, Communication and Hierarchy: Applications to Cooperative Games (Q5057948) (← links)
- Augmenting and Decreasing Systems (Q5215352) (← links)
- (Q5241109) (← links)
- The Clique Corona Operation and Greedoids (Q5505676) (← links)
