Sciweavers

7773 search results - page 6 / 1555
» On generalized Frame-Stewart numbers
Sort
View
SIAMDM
2000
103views more  SIAMDM 2000»
14 years 9 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
COMGEO
2011
ACM
14 years 4 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
COMPGEOM
2004
ACM
15 years 3 months ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
DCG
2010
93views more  DCG 2010»
14 years 9 months ago
General Lower Bounds for the Minor Crossing Number of Graphs
Drago Bokal, Éva Czabarka, Lászl&oac...
51
Voted
MOC
1998
72views more  MOC 1998»
14 years 9 months ago
Factors of generalized Fermat numbers
Anders Björn, Hans Riesel