Sciweavers

5889 search results - page 22 / 1178
» Graph Layout Problems
Sort
View
TVCG
2008
109views more  TVCG 2008»
13 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
14 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
14 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
PDP
2005
IEEE
14 years 3 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
JORS
2010
102views more  JORS 2010»
13 years 4 months ago
A spring-embedding approach for the facility layout problem
The facility layout problem is concerned with finding the most efficient arrangement of a given number of departments with unequal area requirements within a facility. The facilit...
I. Castillo, T. Sim