131 search results - page 19 / 27 » Crossing Number and Weighted Crossing Number of Near-Planar ... |
ISAAC
2005
Springer
14 years 7 days 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...
CVPR
2008
IEEE
13 years 8 months ago
2008
IEEE
Diffusion weighted magnetic resonance (MR) imaging is a powerful tool that can be employed to study white matter microstructure by examining the 3D displacement profile of water m...
ESA
2005
Springer
14 years 8 days ago
2005
Springer
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...
CORR
2004
Springer
13 years 6 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
GD
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...