Sciweavers

515 search results - page 2 / 103
» Layouts of Expander Graphs
Sort
View
GD
2005
Springer
13 years 11 months ago
Dynamic Spectral Layout of Small Worlds
Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some gen...
Ulrik Brandes, Daniel Fleischer, Thomas Puppe
ECCC
2007
124views more  ECCC 2007»
13 years 5 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler
GD
2008
Springer
13 years 6 months ago
Dunnart: A Constraint-Based Network Diagram Authoring Tool
We present a new network diagram authoring tool, Dunnart, that provides continuous network layout. It continuously adjusts the layout in response to user interaction, while still m...
Tim Dwyer, Kim Marriott, Michael Wybrow
IV
2005
IEEE
156views Visualization» more  IV 2005»
13 years 11 months ago
Applying Graphical Design Techniques to Graph Visualisation
This paper contains details of new criteria for graph layout, based on the concepts used in graphical design. Current graph layout criteria have been shown to be effective in meas...
Martyn Taylor, Peter Rodgers
JGAA
2007
88views more  JGAA 2007»
13 years 5 months ago
Dynamic Spectral Layout with an Application to Small Worlds
Spectral methods are naturally suited for dynamic graph layout because, usually, moderate changes of a graph yield moderate changes of the layout. We discuss some general principl...
Ulrik Brandes, Daniel Fleischer, Thomas Puppe