119 search results - page 16 / 24 » Crossing numbers of imbalanced graphs |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...
JGAA
2000
13 years 7 months ago
2000
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 ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
GD
1998
Springer
13 years 12 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...