The following pages link to (Q3138288):
Displaying 6 items.
- Flow equivalent trees in undirected node-edge-capacitated planar graphs (Q845841) (← links)
- Boundary-to-Boundary Flows in Planar Graphs (Q2870017) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Flow-Cut Gaps and Face Covers in Planar Graphs (Q5236214) (← links)
- Some flow-equivalent planar and non-planar graphs (Q5948986) (← links)