Introduction to Greedoids
From MaRDI portal
Publication:4012035
DOI10.1017/CBO9780511662041.009zbMath0772.05026OpenAlexW2131096251WikidataQ55869157 ScholiaQ55869157MaRDI QIDQ4012035
Günter M. Ziegler, Anders Bjoerner
Publication date: 27 September 1992
Published in: Matroid Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/cbo9780511662041.009
surveycombinatorial optimizationspanning treematroidsgreedy algorithmsPrim's algorithmgreedoidantimatroidsKruskal's algorithmgreedoid polynomial
Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (56)
Zonotopal algebra and forward exchange matroids ⋮ Weighted Rooted Trees: Fat or Tall? ⋮ Generating and characterizing the perfect elimination orderings of a chordal graph ⋮ Polygon posets and the weak order of Coxeter groups ⋮ A greedy algorithm for interval greedoids ⋮ Critical sets, crowns and local maximum independent sets ⋮ Abelian networks IV. Dynamics of nonhalting networks ⋮ An algorithmic characterization of antimatroids ⋮ Branchings in rooted graphs and the diameter of greedoids ⋮ Abelian sandpile model and Biggs-Merino polynomial for directed graphs ⋮ THE QUIVER OF THE SEMIGROUP ALGEBRA OF A LEFT REGULAR BAND ⋮ Synthesis of implementations for divide-and-conquer specifications ⋮ On Brylawski's generalized duality ⋮ Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings ⋮ Local maximum stable set greedoids stemming from very well-covered graphs ⋮ Two sided Sand Piles Model and unimodal sequences ⋮ Forbidden subgraphs and the König-Egerváry property ⋮ On local maximum stable set greedoids ⋮ Expected rank in antimatroids ⋮ Oriented interval greedoids ⋮ Impartial achievement games on convex geometries ⋮ ULD-Lattices and Δ-Bonds ⋮ Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids ⋮ Cubical token systems ⋮ Interval partitions and activities for the greedoid Tutte polynomial ⋮ On the diameter of tree associahedra ⋮ Quasi-concave functions on meet-semilattices ⋮ Chip-firing games on directed graphs ⋮ The max-flow min-cut property of two-dimensional affine convex geometries ⋮ Enumeration in convex geometries and associated polytopal subdivisions of spheres ⋮ Cellular structure for the Herzog-Takayama resolution ⋮ The computational complexity of antimatroid properties ⋮ Characterizations of polygreedoids and poly-antimatroids by greedy algorithms ⋮ The affine representation theorem for abstract convex geometries ⋮ Graph operations that are good for greedoids ⋮ Factorisation of greedoid polynomials of rooted digraphs ⋮ Expected value expansions in rooted graphs ⋮ VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS ⋮ Series-parallel posets and the Tutte polynomial ⋮ Pruning processes and a new characterization of convex geometries ⋮ On the greedoid polynomial for rooted graphs and rooted digraphs ⋮ Representation of fragmentary structures by oriented graphs ⋮ Recognition of Antimatroidal Point Sets ⋮ Oracles for vertex elimination orderings ⋮ A new notion of vertex independence and rank for finite graphs ⋮ Distributive Lattice Polyhedra ⋮ The Clique Corona Operation and Greedoids ⋮ A new greedoid: The family of local maximum stable sets of a forest ⋮ The chip-firing game ⋮ Linear relations for a generalized Tutte polynomial ⋮ Introduction to the combinatorial atlas ⋮ A Geometric Characterization of Poly-antimatroids ⋮ A Greedoid Polynomial Which Distinguishes Rooted Arborescences ⋮ Chip-firing games on graphs ⋮ Gray codes from antimatroids ⋮ Dynamic pricing and the direct-to-customer model in the automotive industry
This page was built for publication: Introduction to Greedoids
