26 search results - page 3 / 6 » Computing Radial Drawings on the Minimum Number of Circles |
159
click to vote
GD
2006
Springer
15 years 9 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
145
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
144
click to vote
GD
2007
Springer
16 years 4 days ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
142
click to vote
SPIRE
2005
Springer
15 years 11 months ago
2005
Springer
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing th...
158
click to vote
CCCG
2004
15 years 7 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...