The Lattice Structure of Flow in Planar Graphs
From MaRDI portal
Publication:3136618
Recommendations
Cited in
(20)
- Faster shortest paths in dense distance graphs, with applications
- Decomposition theorem on matchable distributive lattices
- Some flow-equivalent planar and non-planar graphs
- Lattices and maximum flow algorithms in planar graphs
- Willmore flow of planar networks
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs
- Lattice structures from planar graphs
- Distributive lattices, polyhedra, and generalized flows
- Transversal structures on triangulations: A combinatorial study and straight-line drawings
- Zero-sum flows of the linear lattice.
- Lattice flows in networks
- Non-matchable distributive lattices
- Maximum flow in directed planar graphs with vertex capacities
- ULD-lattices and \(\Delta \)-bonds
- Title not available (Why is no real title available?)
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- Title not available (Why is no real title available?)
- Flows in infinite networks represented by vector lattices
- Boundary-to-Boundary Flows in Planar Graphs
This page was built for publication: The Lattice Structure of Flow in Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136618)