35 search results - page 3 / 7 » gd 2008 |
GD
2008
Springer
13 years 7 months 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
13 years 7 months ago
2008
Springer
We present a new network diagram authoring tool, Dunnart, that provides continuous network layout. It continuously adjusts the layout in response to user interaction, while still m...
GD
2008
Springer
13 years 7 months ago
2008
Springer
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of dir...
VTC
2008
IEEE
14 years 19 days ago
2008
IEEE
Abstract— In this paper, we propose a new groupwise receiver combiner design method for spatial multiplexing multipleinput multiple-output (MIMO) systems. The conventional group ...
GD
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...