Sciweavers

514 search results - page 70 / 103
» Drawing a Graph in a Hypercube
Sort
View
DCG
2011
14 years 1 months ago
A Celtic Framework for Knots and Links
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
Jonathan L. Gross, Thomas W. Tucker
SCAM
2003
IEEE
15 years 2 months ago
The Java System Dependence Graph
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...
Neil Walkinshaw, Marc Roper, Murray Wood
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
15 years 1 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...
APVIS
2001
14 years 11 months ago
Information Visualisation using Composable Layouts and Visual Sets
This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph....
Tim Pattison, Rudi Vernik, Matthew Phillips
GD
2009
Springer
15 years 2 months ago
Removing Independently Even Crossings
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...