A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in the vertical direction, and no two edges cross. An undirected graph isâ€¦ (More)

Let N be a single-source single-sink ow network with n nodes, m arcs, and positive arc costs. We present a pseudo-polynomial algorithm that computes a maximum ow of minimum cost for N in time O(3=4 mâ€¦ (More)

Let G be a plane graph of n nodes, m edges, f faces, and no self-loop. G need not be connected or simple (i.e., free of multiple edges). We give three sets of coding schemes for G which all take O(mâ€¦ (More)

We investigate the problem of constructing planar straight-line drawings of graphs with large angles between the edges. Namely, we study the angular resolution of planar straight-line drawings,â€¦ (More)

In this paper we present an extensive experimental study comparing four general-purpose graph drawing algorithms. The four algorithms take as input general graphs (with no restrictions whatsoever onâ€¦ (More)

Rooted trees are usually drawn planar and upward, i.e., without crossings and without any parent placed below its child. In this paper we investigate the area requirement of planar upward drawings ofâ€¦ (More)

Constraint-based graph drawing systems provide expressive power and exibility. Previously proposed approaches make use of general constraint solvers, which are ineecient, and of textual speciicationâ€¦ (More)