Results 1  10
of
1,612
CrossingFree Acyclic Hamiltonian Path Completion for Planar stDigraphs
, 909
"... Abstract. In this paper we study the problem of existence of a crossingfree acyclic hamiltonian path completion (for short, HPcompletion) set for embedded upward planar digraphs. In the context of book embeddings, this question becomes: given an embedded upward planar digraph G, determine whether ..."
Abstract
 Add to MetaCart
there exists an upward 2page book embedding of G preserving the given planar embedding. Given an embedded stdigraph G which has a crossingfree HPcompletion set, we show that there always exists a crossingfree HPcompletion set with at most two edges per face of G. For an embedded Nfree upward planar
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
Communicated by:
, 2010
"... Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (acyclicHPCCM) to be the problem of determining a hamiltonian path completion set of edges such that, when these edges are embedded on G, they create thesmallest possi ..."
Abstract
 Add to MetaCart
possible numberofedgecrossings andturnGtoahamiltonian acyclic digraph. Our results include: 1. We provide a characterization under which a planar stdigraph G is hamiltonian. 2. For an outerplanar stdigraph G, we define the stPolygon decomposition of G and, based on its properties, we develop a linear
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2837 (11 self)
 Add to MetaCart
;enyi's nonmonotone result [Imm88, Sze87] that NL = coNL; this is a simple extension of the monotone circuit depth lower bound of Karchmer and Wigderson [KW90] for stconnectivity. We also consider mBWBP (monotone bounded width branching programs) and study the question of whether mBWBP is properly contained
Upward Planarity Testing
 SIAM Journal on Computing
, 1995
"... Acyclic digraphs, such as the covering digraphs of ordered sets, are usually drawn upward, i.e., with the edges monotonically increasing in the vertical direction. A digraph is upward planar if it admits an upward planar drawing. In this survey paper, we overview the literature on the problem of upw ..."
Abstract

Cited by 87 (13 self)
 Add to MetaCart
Acyclic digraphs, such as the covering digraphs of ordered sets, are usually drawn upward, i.e., with the edges monotonically increasing in the vertical direction. A digraph is upward planar if it admits an upward planar drawing. In this survey paper, we overview the literature on the problem
Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
 IEEE Transactions on Visualization and Computer Graphics
, 2006
"... Abstractâ€”A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., nonhierarch ..."
Abstract

Cited by 273 (12 self)
 Add to MetaCart
Abstractâ€”A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., nonhierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a Bspline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical bundling reduces visual clutter and also visualizes implicit adjacency edges between parent nodes that are the result of explicit adjacency edges between their respective child nodes. Furthermore, hierarchical edge bundling is a generic method which can be used in conjunction with existing tree visualization techniques. We illustrate our technique by providing example visualizations and discuss the results based on an informal evaluation provided by potential users of such visualizations.
On the Computational Complexity of Upward and Rectilinear Planarity Testing (Extended Abstract)
, 1994
"... 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 rectilinear planar if it can be drawn in the plane such that every edge is a horizontal or vertical se ..."
Abstract

Cited by 107 (4 self)
 Add to MetaCart
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 rectilinear planar if it can be drawn in the plane such that every edge is a horizontal or vertical
Results 1  10
of
1,612