LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
DiamondTouch: a multi-user touch technology
Proceedings of the 14th annual ACM symposium on User interface software and technology
Level Planarity Testing in Linear Time
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Journal of Computer and System Sciences
Characterization of unlabeled level planar trees
GD'06 Proceedings of the 14th international conference on Graph drawing
Practical level planarity testing and layout with embedding constraints
GD'07 Proceedings of the 15th international conference on Graph drawing
Minimum level nonplanar patterns for trees
GD'07 Proceedings of the 15th international conference on Graph drawing
Simultaneous geometric graph embeddings
GD'07 Proceedings of the 15th international conference on Graph drawing
Simultaneous graph embeddings with fixed edges
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Two trees which are self–intersecting when drawn simultaneously
GD'05 Proceedings of the 13th international conference on Graph Drawing
An interactive multi-user system for simultaneous graph drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
Colored simultaneous geometric embeddings
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Hi-index | 0.00 |
Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET , designed to allow the investigation of a wide range of embedding problems. GraphSET can be used in the study of several variants of simultaneous embedding including simultaneous geometric embedding, simultaneous embedding with fixed edges and colored simultaneous embedding with the vertex set partitioned into color classes. The tool has two primary uses: (i) studying theoretical problems in simultaneous graph drawing through the production of examples and counterexamples and (ii) producing layouts of given classes of graphs using built-in implementations of known algorithms. GraphSET along with movies illustrating its utility are available at http://graphset.cs.arizona.edu.