Sciweavers

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

115

Voted

SPAA
1998
ACM

98views Distributed And Parallel Com...» more SPAA 1998»

Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract)

15 years 7 months ago

Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract)

Download www.im.pwr.wroc.pl

Micah Adler, Wolfgang Dittrich, Ben H. H. Juurlink

Real-time Traffic

Distributed And Parallel Computing | SPAA 1998 |

claim paper

Related Content

» Brief announcement minimum spanning trees and conebased topology control

» Distributed Search for Balanced Energy Consumption Spanning Trees in Wireless Sensor Netwo...

» Standard Template Library for XXL Data Sets

» NPcompleteness and FPT Results for Rectilinear Covering Problems

» Connected kHop Clustering in Ad Hoc Networks

» Edge Disjoint Paths in Moderately Connected Graphs

» Relay Placement for Higher Order Connectivity in Wireless Sensor Networks

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	SPAA
Authors	Micah Adler, Wolfgang Dittrich, Ben H. H. Juurlink, Miroslaw Kutylowski, Ingo Rieping

Comments (0)