The following pages link to Greedoids (Q810029):
Displaying 50 items.
- Local maximum stable set greedoids stemming from very well-covered graphs (Q444454) (← links)
- The joy of implications, aka pure Horn formulas: mainly a survey (Q507516) (← links)
- A convex polytope and an antimatroid for any given, finite group (Q510527) (← links)
- On the shelling antimatroids of split graphs (Q510993) (← links)
- A game semantics for system P (Q514506) (← links)
- Games with a permission structure -- a survey on generalizations and applications (Q526627) (← links)
- Matroids on convex geometries: subclasses, operations, and optimization (Q638783) (← links)
- A system-theoretic model for cooperation, interaction and allocation (Q643011) (← links)
- On local maximum stable set greedoids (Q658102) (← links)
- Split decomposition over an Abelian group. I: Generalities (Q659783) (← links)
- Oriented interval greedoids (Q664550) (← links)
- Transversal greedoids (Q674616) (← links)
- Interval partitions and activities for the greedoid Tutte polynomial (Q679037) (← links)
- The affine representation theorem for abstract convex geometries (Q705549) (← links)
- A branching greedoid for multiply-rooted graphs and digraphs (Q708389) (← links)
- Duality between quasi-concave functions and monotone linkage functions (Q712240) (← links)
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons (Q724738) (← links)
- Matroids and antimatroids - a survey (Q757382) (← links)
- Injection geometries (Q801926) (← links)
- Extreme point axioms for closure spaces (Q856869) (← links)
- On the topology of the free complexes of convex geometries (Q864169) (← links)
- Matroids on convex geometries (cg-matroids) (Q882114) (← links)
- Categories of \((I, I)\)-fuzzy greedoids (Q898215) (← links)
- Convexity properties for interior operator games (Q926361) (← links)
- Algorithms for media (Q947070) (← links)
- A unified interpretation of several combinatorial dualities (Q951109) (← links)
- Monge extensions of cooperation and communication structures (Q976406) (← links)
- Characterizations of the convex geometries arising from the double shellings of posets (Q982616) (← links)
- Graph operations that are good for greedoids (Q987691) (← links)
- A Tutte polynomial which distinguishes rooted unicyclic graphs (Q1003609) (← links)
- The complexity of the matroid-greedoid partition problem (Q1006060) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- A general model for matroids and the greedy algorithm (Q1013980) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- Pruning processes and a new characterization of convex geometries (Q1025925) (← links)
- The sorting order on a Coxeter group. (Q1040844) (← links)
- Axiomatizations of the Shapley value for games on augmenting systems (Q1041948) (← links)
- On verifying and engineering the wellgradedness of a union-closed family (Q1042303) (← links)
- Note on two necessary and sufficient axioms for a well-graded knowledge space (Q1042304) (← links)
- A note on selectors and greedoids (Q1061744) (← links)
- Homotopy properties of greedoids (Q1101115) (← links)
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299) (← links)
- Pseudomatroids (Q1109779) (← links)
- Greedy algorithm compatibility and heavy-set structures (Q1193543) (← links)
- Discrete convex analysis (Q1290668) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- Counting convex polygons in planar point sets (Q1350236) (← links)
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches. (Q1406042) (← links)
- A greedy algorithm for convex geometries (Q1410695) (← links)
- The forbidden minor characterization of line-search antimatroids of rooted digraphs (Q1410699) (← links)
