Pages that link to "Item:Q5236214"
From MaRDI portal
The following pages link to Flow-Cut Gaps and Face Covers in Planar Graphs (Q5236214):
Displaying 5 items.
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- Coarse differentiation and multi-flows in planar graphs (Q848676) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- (Q6087213) (← links)