Sciweavers

515 search results - page 43 / 103
» Layouts of Expander Graphs
Sort
View
96
Voted
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
15 years 6 months ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
15 years 6 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
108
Voted
ESANN
2006
15 years 2 months ago
Visualizing gene interaction graphs with local multidimensional scaling
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
Jarkko Venna, Samuel Kaski
GD
1998
Springer
15 years 4 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
ISCAS
1994
IEEE
93views Hardware» more  ISCAS 1994»
15 years 4 months ago
The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
Achim G. Hoffmann