Antimatroids, Betweenness, Convexity
From MaRDI portal
Publication:2971604
DOI10.1007/978-3-540-76796-1_3zbMath1359.05018OpenAlexW206965105MaRDI QIDQ2971604
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_3
Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Betweenness in Order-Theoretic Trees, Betweenness relations and gated sets in fuzzy metric spaces, Conceptual orthospaces -- convexity meets negation, On subbetweennesses of trees: hardness, algorithms, and characterizations, Strict betweennesses induced by posets as well as by graphs, Antimatroids and balanced pairs, Characterizations of the convex geometries arising from the double shellings of posets, Betweenness of partial orders
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- Greedoids
- The theory of convex geometries
- A circuit set characterization of antimatroids
- Convex sets in graphs. II: Minimal path convexity
- Meet-distributive lattices and the anti-exchange closure
- Axiomatic convexity theory and relationships between the Carathéodory, Helly, and Radon numbers
- Lattices with unique irreducible decompositions
- Convexity in Graphs and Hypergraphs
- On the Abstract Properties of Linear Dependence
- Some Elementary Properties of Interval Convexities