Recommendations
Cited in
(only showing first 100 items - show all)- A Geometric Characterization of Poly-antimatroids
- Categories of \((I, I)\)-fuzzy greedoids
- Polyhedral approach to weighted connected matchings in general graphs
- Krein-Milman spaces
- Dual greedy polyhedra, choice functions, and abstract convex geometries
- Antimatroids and balanced pairs
- Dynamic programming and graph optimization problems
- Oriented interval greedoids
- Closure systems and their structure
- Note on two necessary and sufficient axioms for a well-graded knowledge space
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- On the geometric structure of independence systems
- Factorisation of greedoid polynomials of rooted digraphs
- New polyhedral and algorithmic results on greedoids
- An extended formulation of the convex recoloring problem on a tree
- Expected rank in antimatroids
- scientific article; zbMATH DE number 2116373 (Why is no real title available?)
- Quasi-concave functions on meet-semilattices
- The chip-firing game
- Matroids on convex geometries: subclasses, operations, and optimization
- A new greedoid: The family of local maximum stable sets of a forest
- Perspectives of Monge properties in optimization
- On verifying and engineering the wellgradedness of a union-closed family
- Trees as semilattices
- Homotopy properties of greedoids
- Greedoids and Linear Objective Functions
- Multiple facility location on a network with linear reliability order of edges
- Interpolation theorems for graphs, hypergraphs and matroids
- Characterizations of graph classes via convex geometries: a survey
- Extreme point axioms for closure spaces
- A general model for matroids and the greedy algorithm
- Matroids on convex geometries (cg-matroids)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why.
- A disturbed version of the greedy algorithm
- Reconfiguring (non-spanning) arborescences
- Secretary problem: graphs, matroids and greedoids
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
- When bad things happen to good trees
- A discrete duality between nonmonotonic consequence relations and convex geometries
- A value for cooperative games on simplicial complexes with a filtration
- Oracles for vertex elimination orderings
- Path-independence and closure operators with the anti-exchange property
- Coordinatization of finite join-distributive lattices.
- scientific article; zbMATH DE number 4137538 (Why is no real title available?)
- Subspace Procrustes analysis
- A note on selectors and greedoids
- Finding a maximum-weight convex set in a chordal graph
- Split decomposition over an Abelian group. I: Generalities
- Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid
- Counting convex polygons in planar point sets
- The joy of implications, aka pure Horn formulas: mainly a survey
- Impartial hypergraph games
- Introduction to Greedoids
- Fragmentary structures in discrete optimization problems
- Exchange systems
- Games with a permission structure -- a survey on generalizations and applications
- Valuated matroids -- a new look at the greedy algorithm
- Strong greedoid structure of \(r\)-removed \(P\)-orderings
- Mathematics of Plott choice functions
- Injection geometries
- Networks, communication and hierarchy: applications to cooperative games
- A representation of antimatroids by Horn rules and its application to educational systems
- scientific article; zbMATH DE number 4039926 (Why is no real title available?)
- The affine representation theorem for abstract convex geometries
- scientific article; zbMATH DE number 2230309 (Why is no real title available?)
- Interval partitions and activities for the greedoid Tutte polynomial
- A game semantics for system P
- Greedoids from flames
- Algorithms for media
- A unified interpretation of several combinatorial dualities
- Violator spaces vs closure spaces
- Antimatroids, betweenness, convexity
- scientific article; zbMATH DE number 3904604 (Why is no real title available?)
- Distributive lattice polyhedra
- scientific article; zbMATH DE number 4062828 (Why is no real title available?)
- Partition coefficients of acyclic graphs
- Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm
- Operations on greedoids
- The computational complexity of antimatroid properties
- On unicyclic graphs with uniquely restricted maximum matchings
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
- A system-theoretic model for cooperation, interaction and allocation
- Knowledge spaces from a topological point of view
- Concepts of dimension for convex geometries
- Introduction to the combinatorial atlas
- On the diameter of tree associahedra
- A characteristic polynomial for rooted mixed graphs
- Pruning processes and a new characterization of convex geometries
- Network structures with hierarchy and communication
- Fuzzy greedoids
- Compressed representation of learning spaces
- Interaction indices for games on combinatorial structures with forbidden coalitions
- Chordal graphs and their clique graphs
- The structure of a linear chip firing game and related models
- On the topology of the free complexes of convex geometries
- The Bhargava greedoid as a Gaussian elimination greedoid
- Unicycle graphs and uniquely restricted maximum matchings
- Antimatroids induced by matchings
- Impartial achievement games on convex geometries
- A branching greedoid for multiply-rooted graphs and digraphs
This page was built for publication: Greedoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810029)
