Graph drawing by force-directed placement
Software—Practice & Experience
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
GD '95 Proceedings of the Symposium on Graph Drawing
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Maintaining the Mental Map for Circular Drawings
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
IEEE Transactions on Visualization and Computer Graphics
TopoLayout: Multilevel Graph Layout by Topological Features
IEEE Transactions on Visualization and Computer Graphics
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information
IEEE Transactions on Visualization and Computer Graphics
Drawing graphs with non-uniform vertices
Proceedings of the Working Conference on Advanced Visual Interfaces
GD'06 Proceedings of the 14th international conference on Graph drawing
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Visual Analysis of One-to-Many Matched Graphs
Graph Drawing
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Crossing minimization in extended level drawings of graphs
Discrete Applied Mathematics
Proceedings of Graphics Interface 2010
Interactive searching and visualization of patterns in attributed graphs
Proceedings of Graphics Interface 2010
GerbilSphere: Inner sphere network visualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
Layout with circular and other non-linear constraints using procrustes projection
GD'09 Proceedings of the 17th international conference on Graph Drawing
| Hi-index | 0.00 |
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced by a given partition of the micro-level vertices. A typical example is a social network of employees organized into different departments. We do not impose restrictions on the macro-level layout other than sufficient thickness of edges and vertices, so that the micro-level graph can be placed on top of the macrolevel graph. For the micro-level graph we define a combinatorial multicircular embedding and present corresponding layout algorithms based on edge crossing reduction strategies.