Sciweavers

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

101

Voted

SODA
1998
ACM

71views Algorithms» more SODA 1998»

On the Distributed Complexity of Computing Maximal Matchings

15 years 4 months ago

On the Distributed Complexity of Computing Maximal Matchings

Download www.brics.dk

Michal Hanckowiak, Michal Karonski, Alessandro Pan

Real-time Traffic

Algorithms | SODA 1998 |

claim paper

Related Content

» Maximizing throughput in wireless networks via gossiping

» Low complexity stable scheduling algorithms for networks of input queued switches with no ...

» Fast Deterministic Distributed Maximal Independent Set Computation on GrowthBounded Graphs

» Stability of a framebased oldestcellfirst maximal weight matching algorithm

» Maximally Stable Colour Regions for Recognition and Matching

» Energy complexity of optical computations

» Distributed scheduling policies in networks of inputqueued packet switches

» Distributed Algorithm for Computing Formal Concepts Using MapReduce Framework

» Fragmentary Pattern Matching Complexity Algorithms and Applications for Analyzing Classic ...

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	SODA
Authors	Michal Hanckowiak, Michal Karonski, Alessandro Panconesi

Comments (0)