# Some simple distributed algorithms for sparse networks

@article{Panconesi2001SomeSD,
title={Some simple distributed algorithms for sparse networks},
author={A. Panconesi and R. Rizzi},
journal={Distributed Computing},
year={2001},
volume={14},
pages={97-100}
}
• Published 2001
• Computer Science, Engineering
• Distributed Computing
• Summary. We give simple, deterministic, distributed algorithms for computing maximal matchings, maximal independent sets and colourings. We show that edge colourings with at most $2\Delta-1$ colours, and maximal matchings can be computed within ${\cal O}(\log^* n + \Delta)$ deterministic rounds, where $\Delta$ is the maximum degree of the network. We also show how to find maximal independent sets and $(\Delta+1)$-vertex colourings within ${\cal O}(\log^* n + \Delta^2)$ deterministic rounds. All… CONTINUE READING

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES