119 search results - page 15 / 24 » Crossing numbers of imbalanced graphs |
ESA
2001
Springer
14 years 3 days ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
JGT
2006
13 years 7 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
JGAA
1998
13 years 7 months ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
GD
1998
Springer
13 years 12 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...