Greedoids
From MaRDI portal
Publication:810029
zbMATH Open0733.05023MaRDI QIDQ810029FDOQ810029
Authors: Bernhard Korte, Rainer Schrader, László Lovász 
Publication date: 1991
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)
Cited In (only showing first 100 items - show all)
- A system-theoretic model for cooperation, interaction and allocation
- Fuzzy greedoids
- Pruning processes and a new characterization of convex geometries
- The structure of a linear chip firing game and related models
- Compressed representation of learning spaces
- Interaction indices for games on combinatorial structures with forbidden coalitions
- On the topology of the free complexes of convex geometries
- On the rank functions of \(\mathcal{H}\)-matroids
- A branching greedoid for multiply-rooted graphs and digraphs
- Title not available (Why is that?)
- The Bhargava greedoid
- Matroids and antimatroids - a survey
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Polymatroid greedoids
- The Erdos-Szekeres problem on points in convex position – a survey
- Greedy algorithm and symmetric matroids
- Optimizing phylogenetic diversity under constraints
- Duality between quasi-concave functions and monotone linkage functions
- Greedy solutions of selection and ordering problems
- Decompositions in complete lattices. III: Unique irredundant decompositions and convex geometries
- Pseudomatroids
- Convexity properties for interior operator games
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Vertex covering with capacitated trees
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
- A greedy algorithm for convex geometries
- Title not available (Why is that?)
- Enumeration in convex geometries and associated polytopal subdivisions of spheres
- The Clique Corona Operation and Greedoids
- Cooperative games on antimatroids
- Topologically sweeping visibility complexes via pseudotriangulations
- On local maximum stable set greedoids
- Title not available (Why is that?)
- Layered clusters of tightness set functions
- A convex polytope and an antimatroid for any given, finite group
- Monge extensions of cooperation and communication structures
- Resolutions of convex geometries
- Join-semidistributive lattices and convex geometries.
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- Axiomatizations of the Shapley value for games on augmenting systems
- Induced layered clusters, hereditary mappings, and convex geometries
- Graph operations that are good for greedoids
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
- Greedy algorithm compatibility and heavy-set structures
- The sorting order on a Coxeter group.
- Local maximum stable set greedoids stemming from very well-covered graphs
- Discrete convex analysis
- Dual greedy polyhedra, choice functions, and abstract convex geometries
- Closure systems and their structure
- Oriented interval greedoids
- Note on two necessary and sufficient axioms for a well-graded knowledge space
- Quasi-concave functions on meet-semilattices
- The chip-firing game
- A new greedoid: The family of local maximum stable sets of a forest
- Perspectives of Monge properties in optimization
- Matroids on convex geometries: subclasses, operations, and optimization
- Trees as semilattices
- Homotopy properties of greedoids
- 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.
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
- Path-independence and closure operators with the anti-exchange property
- Coordinatization of finite join-distributive lattices.
- Introduction to Greedoids
- Counting convex polygons in planar point sets
- Split decomposition over an Abelian group. I: Generalities
- The joy of implications, aka pure Horn formulas: mainly a survey
- Networks, communication and hierarchy: applications to cooperative games
- Games with a permission structure -- a survey on generalizations and applications
- Mathematics of Plott choice functions
- Greedoids from flames
- The affine representation theorem for abstract convex geometries
- Interval partitions and activities for the greedoid Tutte polynomial
- A game semantics for system P
- Title not available (Why is that?)
- Antimatroids, betweenness, convexity
- Violator spaces vs closure spaces
- Distributive lattice polyhedra
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
- Chordal graphs and their clique graphs
- Network structures with hierarchy and communication
- Unicycle graphs and uniquely restricted maximum matchings
- Antimatroids induced by matchings
- The max-flow min-cut property of two-dimensional affine convex geometries
- Forbidden subgraphs and the König-Egerváry property
- Characterizations of the convex geometries arising from the double shellings of posets
- On maximin share allocations in matroids
- On imposing connectivity constraints in integer programs
- Gross substitutability: an algorithmic survey
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
- The forbidden minor characterization of line-search antimatroids of rooted digraphs
- Log-concave poset inequalities (extended abstract)
- The complexity of the matroid-greedoid partition problem
- A greedy algorithm for interval greedoids
- A Tutte polynomial which distinguishes rooted unicyclic graphs
- Anti-matroids
- Closure spaces that are not uniquely generated
- Expected value expansions in rooted graphs
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)
