Sciweavers

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

108

Voted

IPPS
1998
IEEE

117views Distributed And Parallel Com...» more IPPS 1998»

Asymptotically Optimal Randomized Tree Embedding in Static Networks

15 years 7 months ago

Asymptotically Optimal Randomized Tree Embedding in Static Networks

Download ipdps.cc.gatech.edu

Keqin Li

Real-time Traffic

Distributed And Parallel Computing | IPPS 1998 | Random Walks | Static Networks | Tree Embedding Algorithms |

claim paper

Related Content

» KeyIndependent Optimality

» Brief Announcement Universal Data Aggregation Trees for Sensor Networks in Low Doubling Me...

» A Dynamic Reconfiguration Tolerant Selfstabilizing Token Circulation Algorithm in AdHoc Ne...

» Generalized multicircumcenter trajectories for optimal design under nearindependence

» Branch and Bound on the Network Model

» Neighbor Table Construction and Update in a Dynamic PeertoPeer Network

» Disjoint Paths in Densely Embedded Graphs

» Centralized versus Distributed Schedulers for BagofTasks Applications

» An Enhanced tree based MAODV Protocol for MANETs using Genetic Algorithm

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	IPPS
Authors	Keqin Li

Comments (0)