Sciweavers

514 search results - page 8 / 103
» Drawing a Graph in a Hypercube
Sort
View
IPPS
1999
IEEE
13 years 11 months ago
Sparse Hypercube: A Minimal k-Line Broadcast Graph
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
Satoshi Fujita, Arthur M. Farley
GD
2004
Springer
14 years 23 days ago
Drawing the AS Graph in 2.5 Dimensions
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
Michael Baur, Ulrik Brandes, Marco Gaertler, Dorot...
HICSS
1995
IEEE
98views Biometrics» more  HICSS 1995»
13 years 11 months ago
Fault-tolerant graphs for hypercubes and tori
Toshinori Yamada, Koji Yamamoto, Shuichi Ueno
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 7 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
KES
2008
Springer
13 years 7 months ago
Readable Representations for Large-Scale Bipartite Graphs
Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is a...
Shuji Sato, Kazuo Misue, Jiro Tanaka