Learn More
We study a new standard for visualizing graphs: A monotone drawing is a straight-line drawing such that, for every pair of vertices, there exists a path that monotonically increases with respect to some direction. We show algorithms for constructing monotone planar drawings of trees and biconnected planar graphs, we study the interplay between monotonicity,(More)
We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced by Gao [IEEE/ACM TRANSACTIONS ON NETWORKING, 9(6):733-645, 2001] and Subramanian et al. (IEEE Infocom, 2002) that bases the discovery of such relationships on the analysis of the AS paths extracted from the BGP routing(More)
Consider a planar drawing Γ of a planar graph G such that the vertices are drawn as small circles and the edges are drawn as thin strips. Consider a cycle c of G. Is it possible to draw c as a non-intersecting closed curve inside Γ, following the circles that correspond in Γ to the vertices of c and the strips that connect them? We show that this test can(More)
In this paper we describe the architecture and the visual interface of BGPlay, an on-line service for the visualization of the behavior and of the instabilities of Internet routing at the autonomous system level. A graph showing only the connections among autonomous systems is not enough to convey all the information needed to fully understand routing and(More)
We study the following problem: Given a planar graph <i>G</i> and a planar drawing (embedding) of a subgraph of <i>G</i>, can such a drawing be extended to a planar drawing of the entire graph <i>G</i>? This problem fits the paradigm of extending a partial solution to a complete one, which has been studied before in many different settings. Unlike many(More)
In this paper we investigate the computational complexity of the following problem. Given a planar graph in which some vertices have already been placed in the plane (i.e., a partial embedding), place the remaining vertices to form a planar straight-line drawing of the graph. We show that the above extensibility problem, mentioned in the 2003 paper "(More)