Sciweavers

369 search results - page 15 / 74
» Layouts of Graph Subdivisions
Sort
View
95
Voted
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 2 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
GD
2005
Springer
15 years 3 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
TVCG
2008
109views more  TVCG 2008»
14 years 9 months ago
Rapid Graph Layout Using Space Filling Curves
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link...
Chris Muelder, Kwan-Liu Ma
GD
2006
Springer
15 years 1 months ago
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
Ulrik Brandes, Christian Pich
GD
1994
Springer
15 years 1 months ago
A Fast Adaptive Layout Algorithm for Undirected Graphs
d Abstract and System Demonstration) Arne Frick , Andreas Ludwig, Heiko Mehldau Universit
Arne Frick, Andreas Ludwig, Heiko Mehldau