The following pages link to Greedoids (Q810029):
Displaying 50 items.
- Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings (Q1414591) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- Expected rank in antimatroids (Q1433007) (← links)
- The greedy algorithm and Coxeter matroids (Q1575099) (← links)
- Interpolation theorems for graphs, hypergraphs and matroids (Q1584241) (← links)
- Closure systems and their structure (Q1602560) (← links)
- Layered clusters of tightness set functions (Q1609443) (← links)
- Anti-matroids (Q1612010) (← links)
- On maximin share allocations in matroids (Q1628590) (← links)
- Convex geometries are extremal for the generalized Sauer-Shelah bound (Q1640207) (← links)
- A greedy algorithm for interval greedoids (Q1644861) (← links)
- Polluted river problems and games with a permission structure (Q1651269) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Compressed representation of learning spaces (Q1679036) (← links)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- Fragmentary structures in discrete optimization problems (Q1699407) (← links)
- Decompositions in complete lattices. III: Unique irredundant decompositions and convex geometries (Q1703283) (← links)
- Antimatroids induced by matchings (Q1730258) (← links)
- Network structures with hierarchy and communication (Q1730812) (← links)
- Closure spaces that are not uniquely generated (Q1766744) (← links)
- Path-independence and closure operators with the anti-exchange property (Q1766745) (← links)
- Krein-Milman spaces (Q1792115) (← links)
- A disturbed version of the greedy algorithm (Q1808486) (← links)
- Expected value expansions in rooted graphs (Q1811135) (← links)
- Topologically sweeping visibility complexes via pseudotriangulations (Q1816465) (← links)
- Exchange systems (Q1823954) (← links)
- On the geometric structure of independence systems (Q1824559) (← links)
- Cooperative games on antimatroids (Q1827722) (← links)
- A new greedoid: The family of local maximum stable sets of a forest (Q1850118) (← links)
- Induced layered clusters, hereditary mappings, and convex geometries (Q1861759) (← links)
- Join-semidistributive lattices and convex geometries. (Q1865285) (← links)
- Generating and characterizing the perfect elimination orderings of a chordal graph (Q1885018) (← links)
- Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions (Q1895106) (← links)
- Trees as semilattices (Q1901055) (← links)
- Well-layered maps---a class of greedily optimizable set functions (Q1904519) (← links)
- Pfaffian forms and \(\Delta\)-matroids with coefficients (Q1910553) (← links)
- Closure lattices (Q1918553) (← links)
- Perspectives of Monge properties in optimization (Q1923588) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- A greedoid and a matroid inspired by Bhargava's \(p\)-orderings (Q2040003) (← links)
- Factorisation of greedoid polynomials of rooted digraphs (Q2053691) (← links)
- Secretary problem: graphs, matroids and greedoids (Q2068844) (← links)
- Introduction to the combinatorial atlas (Q2105654) (← links)
- Enumerating maximal consistent closed sets in closure systems (Q2117117) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- Sufficient conditions for the optimality of the greedy algorithm in greedoids (Q2168727) (← links)
