Planar Network Flows
Planar Network Flows is a specialized class of network flow problems in which the underlying graph is planar, meaning it can be embedded in the plane without any edges crossing, and in which flow is routed between sources and sinks while respecting capacity constraints and planar duality properties inherent to the graph’s topological structure.
19
Publications
679
Citations
43
Authors
26
Institutions
Publications per year
2017–2026
2
19
Maximum Flow in Planar Networks
Alon Itai, Yossi Shiloach · SIAM Journal on Computing · 1979 · 123 citations
1–5 of 19
43
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 43
26
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
4 publications
275 citations
Stanford University
Stanford, United States
2 h-index
3 publications
41 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
2 h-index
4 publications
55 citations

Imperial College London
London, United Kingdom
1 h-index
1 publications
13 citations
University College London
London, United Kingdom
1 h-index
1 publications
13 citations

University of Baltimore
Baltimore, United States
1 h-index
1 publications
13 citations
Board of the Swiss Federal Institutes of Technology
Zurich, Switzerland
1 h-index
1 publications
13 citations
ETH Zurich
Zurich, Switzerland
1 h-index
1 publications
13 citations
1–8 of 26
2 publications · 163 citations
2
h-index
2 publications · 42 citations
2
h-index
1 publications · 15 citations
1
h-index
JBM · 1 publications · 23 citations
1
h-index
Repository · 1 publications · 21 citations
1
h-index
1–5