GD
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. 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, de...
GD
2008
Springer
14 years 19 days ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
GD
2008
Springer
14 years 19 days ago
2008
Springer
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
GD
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
GD
2008
Springer
14 years 19 days ago
2008
Springer
GD
2008
Springer
14 years 19 days ago
2008
Springer
GD
2008
Springer
14 years 19 days ago
2008
Springer
GD
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
GD
2008
Springer
14 years 19 days ago
2008
Springer
Abstract. We introduce the concept of subdivision drawings of hypergraphs. In a subdivision drawing each vertex corresponds uniquely to a face of a planar subdivision and, for each...
GD
2008
Springer
14 years 19 days ago
2008
Springer