A New Minimum Cost Flow Algorithm with Applications to Graph DrawingGarg, Ashim and Tamassia, Roberto (1997) A New Minimum Cost Flow Algorithm with Applications to Graph Drawing. In: Symposium on Graph Drawing, GD '96, September 1820, 1996 , pp. 201216(Official URL: http://dx.doi.org/10.1007/3540624953_49). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540624953_49
AbstractLet N be a singlesource singlesink flow network with n nodes, m arcs, and positive arc costs. We present a pseudopolinomial algorithm that computes a maximum flow of minimum cost for N in time O( X^(3/4)m* \sqrt{logn}), where X is the cost of the flow. This improves upon previously known methods for networks where the minimum cost of the flow is small. We also show an application of our flow algorithm to a wellknown graph drawing problem. Namely, we show how to compute a planar orthogonal drawing with the minimum number of bends for an nvertex embedded planar graph in time O(n^(7/4)* \sqrt{logn}). This is the firs subquadratic algorithm for bend minimization. The previous best bound for this problem was O(n²logn).
Actions (login required)
