Recommendations
Cited in
(only showing first 100 items - show all)- 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
- On the rank functions of \(\mathcal{H}\)-matroids
- Matroids and antimatroids - a survey
- scientific article; zbMATH DE number 4191655 (Why is no real title available?)
- The Bhargava greedoid
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Polymatroid greedoids
- Characterizations of the convex geometries arising from the double shellings of posets
- The max-flow min-cut property of two-dimensional affine convex geometries
- Choice resolutions
- Forbidden subgraphs and the König-Egerváry property
- Duality between quasi-concave functions and monotone linkage functions
- The Erdos-Szekeres problem on points in convex position – a survey
- Optimizing phylogenetic diversity under constraints
- Greedy algorithm and symmetric matroids
- Decompositions in complete lattices. III: Unique irredundant decompositions and convex geometries
- Pseudomatroids
- On maximin share allocations in matroids
- On imposing connectivity constraints in integer programs
- Gross substitutability: an algorithmic survey
- Greedy solutions of selection and ordering problems
- Convexity properties for interior operator games
- Strong IP formulations need large coefficients
- CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
- Augmenting and decreasing systems
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
- The forbidden minor characterization of line-search antimatroids of rooted digraphs
- Tropical Carathéodory with matroids
- Vertex covering with capacitated trees
- The complexity of the matroid-greedoid partition problem
- A greedy algorithm for convex geometries
- Log-concave poset inequalities (extended abstract)
- Log-concave poset inequalities
- A Tutte polynomial which distinguishes rooted unicyclic graphs
- A greedy algorithm for interval greedoids
- Enumeration in convex geometries and associated polytopal subdivisions of spheres
- Anti-matroids
- Cooperative games on antimatroids
- scientific article; zbMATH DE number 7662166 (Why is no real title available?)
- Closure spaces that are not uniquely generated
- The Clique Corona Operation and Greedoids
- Expected value expansions in rooted graphs
- Topologically sweeping visibility complexes via pseudotriangulations
- On local maximum stable set greedoids
- A convex polytope and an antimatroid for any given, finite group
- Monge extensions of cooperation and communication structures
- Layered clusters of tightness set functions
- scientific article; zbMATH DE number 3871387 (Why is no real title available?)
- Minimum partition of an independence system into independent sets
- Resolutions of convex geometries
- Well-layered maps and the maximum-degree k k-subdeterminant of a matrix of rational functions
- The greedy algorithm and Coxeter matroids
- Well-layered maps---a class of greedily optimizable set functions
- Critical sets, crowns and local maximum independent sets
- Cospanning characterizations of violator and co-violator spaces
- Two flags in a semimodular lattice generate an antimatroid
- Tabling with sound answer subsumption
- Polluted river problems and games with a permission structure
- Enumerating maximal consistent closed sets in closure systems
- Closure lattices
- Convex geometries are extremal for the generalized Sauer-Shelah bound
- Join-semidistributive lattices and convex geometries.
- Axiomatizations of the Shapley value for games on augmenting systems
- Graph operations that are good for greedoids
- Induced layered clusters, hereditary mappings, and convex geometries
- The \(S\)-digraph optimization problem and the greedy algorithm
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- A greedy algorithm for dropping digits
- Pfaffian forms and \(\Delta\)-matroids with coefficients
- Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
- A greedoid and a matroid inspired by Bhargava's \(p\)-orderings
- Local maximum stable set greedoids stemming from very well-covered graphs
- Greedy algorithm compatibility and heavy-set structures
- The sorting order on a Coxeter group.
- scientific article; zbMATH DE number 4019084 (Why is no real title available?)
- Discrete convex analysis
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)
