Sciweavers

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

86

Voted

JPDC
1998

54views more JPDC 1998»

Lower Bounds for Dynamic Tree Embedding in Bipartite Networks

15 years 2 months ago

Lower Bounds for Dynamic Tree Embedding in Bipartite Networks

Download www.cs.gsu.edu

Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, Si-

Real-time Traffic

JPDC 1998 |

claim paper

Related Content

» Lower bounds for graph embeddings and combinatorial preconditioners

» Aggregation convergecast scheduling in wireless sensor networks

» Pointset embeddings of plane 3trees

» Ring versus Tree Embedding for Realtime Group Multicast

» Directed soft arc consistency in pseudo trees

» Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard RealTime Systems

» Efficient Query Processing in Large Traffic Networks

» Labeling Schemes with Queries

» GIST GroupIndependent Spanning Tree for Data Aggregation in Dense Sensor Networks

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	JPDC
Authors	Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, Si-Qing Zheng

Comments (0)