Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

77

Voted

COMGEO
2008
ACM

favoriteEmaildiscussreport

81views Applied Computing» more COMGEO 2008»

I/O-efficient algorithms for computing planar geometric spanners

15 years 6 days ago

I/O-efficient algorithms for computing planar geometric spanners

Download people.scs.carleton.ca

Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh

Real-time Traffic

Applied Computing | COMGEO 2008 |

claim paper

Related Content

» On Geometric Spanners of Euclidean and Unit Disk Graphs

» Geometric Spanners for Wireless Ad Hoc Networks

» Spanners Weak Spanners and Power Spanners for Wireless Networks

» Geometric spanner for routing in mobile networks

» Kinetic spanners in Rd

» Randomized and deterministic algorithms for geometric spanners of small diameter

» Regionfault tolerant geometric spanners

» Stable roommates and geometric spanners

» Dynamic algorithms for geometric spanners of small diameter Randomized solutions

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	COMGEO
Authors	Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh

Comments (0)