Distributive lattices, polyhedra, and generalized flows
From MaRDI portal
Publication:607363
DOI10.1016/j.ejc.2010.07.011zbMath1205.06007arXiv0811.1541MaRDI QIDQ607363
Publication date: 22 November 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0811.1541
directed graph; distributive lattice; generalized flows; dominance order; \(D\)-polyhedron; bounding hyperplanes; vertex potentials
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On cocircuit covers of bicircular matroids
- The duality conjecture in formal knot theory
- Two poset polytopes
- A distributive lattice on the set of perfect matchings of a plane bipartite graph
- On the number of bases of bicircular matroids
- Lattice structures from planar graphs
- The lattice structure of the set of domino tilings of a polygon
- Alcoved polytopes. I.
- On subgraphs as matroid cells
- Rings of sets
- The Lattice Structure of Flow in Planar Graphs
- Conway's Tiling Groups
- ULD-Lattices and Δ-Bonds
- Tropical and ordinary convexity combined
- On Max Flows with Gains and Pure Min-Cost Flows
- BICIRCULAR MATROIDS
- Lectures on Polytopes
- On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
- Fast and simple approximation schemes for generalized flow.