Sciweavers

514 search results - page 66 / 103
» Drawing a Graph in a Hypercube
Sort
View
ASUNAM
2010
IEEE
14 years 11 months ago
Pixel-Oriented Visualization of Change in Social Networks
We propose a new approach to visualize social networks. Most common network visualizations rely on graph drawing. While without doubt useful, graphs suffer from limitations like cl...
Klaus Stein, Rene Wegener, Christoph Schlieder
75
Voted
SAC
2009
ACM
15 years 4 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
GD
2004
Springer
15 years 3 months ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
15 years 7 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
COCO
2010
Springer
133views Algorithms» more  COCO 2010»
15 years 1 months ago
Spectral Algorithms for Unique Games
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
Alexandra Kolla