112 search results - page 1 / 23 » Lattices and Maximum Flow Algorithms in Planar Graphs |
COLOGNETWENTE
2010
13 years 2 months ago
2010
ESA
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
CORR
2011
Springer
12 years 10 months ago
2011
Springer
We develop a new technique for computing maximum flow in directed planar graphs with multiple sources and a single sink that significantly deviates from previously known techniqu...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
COCOON
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...