Introduction to Greedoids
From MaRDI portal
Recommendations
Cited in
(97)- Pruning processes and a new characterization of convex geometries
- A note on selectors and greedoids
- Non-interval greedoids and the transposition property
- Linear objective functions on certain classes of greedoids
- Homotopy properties of greedoids
- Pseudomatroids
- Branchings in rooted graphs and the diameter of greedoids
- Greedoids and searches in directed graphs
- Gaussian, strong and transversal greedoids
- Gray codes from antimatroids
- A \(\beta\) invariant for greedoids and antimatroids
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
- Expected rank in antimatroids
- A greedy algorithm for interval greedoids
- Abelian sandpile model and Biggs-Merino polynomial for directed graphs
- Expected value expansions in rooted graphs
- Series-parallel posets and the Tutte polynomial
- A new greedoid: The family of local maximum stable sets of a forest
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Polygon posets and the weak order of Coxeter groups
- On Brylawski's generalized duality
- On the diameter of tree associahedra
- A greedoid and a matroid inspired by Bhargava's \(p\)-orderings
- Factorisation of greedoid polynomials of rooted digraphs
- Introduction to the combinatorial atlas
- Critical sets, crowns and local maximum independent sets
- The Bhargava greedoid
- New polyhedral and algorithmic results on greedoids
- Impartial achievement games on convex geometries
- Cellular structure for the Herzog-Takayama resolution
- Polymatroid greedoids
- Representation of fragmentary structures by oriented graphs
- Linear relations for a generalized Tutte polynomial
- Connectivity of the lifts of a greedoid
- Forbidden subgraphs and the König-Egerváry property
- Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
- Quasi-concave functions on meet-semilattices
- The max-flow min-cut property of two-dimensional affine convex geometries
- Enumeration in convex geometries and associated polytopal subdivisions of spheres
- Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
- Oracles for vertex elimination orderings
- The chip-firing game
- An algorithmic characterization of antimatroids
- Zonotopal algebra and forward exchange matroids
- Distributive lattice polyhedra
- scientific article; zbMATH DE number 4019084 (Why is no real title available?)
- Very well-covered graphs of girth at least four and local maximum stable set greedoids
- scientific article; zbMATH DE number 4191655 (Why is no real title available?)
- Greedoids and Linear Objective Functions
- scientific article; zbMATH DE number 3871387 (Why is no real title available?)
- scientific article; zbMATH DE number 3880732 (Why is no real title available?)
- A Geometric Characterization of Poly-antimatroids
- scientific article; zbMATH DE number 4137538 (Why is no real title available?)
- scientific article; zbMATH DE number 4139765 (Why is no real title available?)
- scientific article; zbMATH DE number 4168699 (Why is no real title available?)
- THE QUIVER OF THE SEMIGROUP ALGEBRA OF A LEFT REGULAR BAND
- Two sided Sand Piles Model and unimodal sequences
- ULD-lattices and \(\Delta \)-bonds
- Recognition of antimatroidal point sets
- Basis graphs of greedoids and two-connectivity
- scientific article; zbMATH DE number 4039926 (Why is no real title available?)
- scientific article; zbMATH DE number 4051650 (Why is no real title available?)
- scientific article; zbMATH DE number 4062828 (Why is no real title available?)
- scientific article; zbMATH DE number 4093481 (Why is no real title available?)
- A Greedoid Polynomial Which Distinguishes Rooted Arborescences
- On the greedoid polynomial for rooted graphs and rooted digraphs
- Local maximum stable set greedoids stemming from very well-covered graphs
- Greedy algorithms and poset matroids
- scientific article; zbMATH DE number 749700 (Why is no real title available?)
- Weighted Rooted Trees: Fat or Tall?
- Abelian networks IV. Dynamics of nonhalting networks
- A new notion of vertex independence and rank for finite graphs
- A new fuzzy greedoids
- The Clique Corona Operation and Greedoids
- The computational complexity of antimatroid properties
- Greedoids from flames
- Synthesis of implementations for divide-and-conquer specifications
- Operations on greedoids
- The Bhargava greedoid as a Gaussian elimination greedoid
- On local maximum stable set greedoids
- Log-concave poset inequalities
- Oriented interval greedoids
- Transversal greedoids
- Interval partitions and activities for the greedoid Tutte polynomial
- Chip-firing games on directed graphs
- Hopf monoids of set families
- The complexity of the greedoid Tutte polynomial
- On supervalid inequalities for binary interdiction games
- The affine representation theorem for abstract convex geometries
- A branching greedoid for multiply-rooted graphs and digraphs
- Optimal antimatroid sorting
- Convex geometry of building sets
- Chip-firing games on graphs
- Greedoids
- Dynamic pricing and the direct-to-customer model in the automotive industry
- Cubical token systems
- Graph operations that are good for greedoids
This page was built for publication: Introduction to Greedoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012035)
