270 search results - page 18 / 54 » Diameter bounds for planar graphs |
SWAT
1994
Springer
15 years 1 months ago
1994
Springer
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
DM
2010
14 years 9 months ago
2010
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
GD
2007
Springer
15 years 3 months 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...
100
Voted
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...