Some Simple Distributed Algorithms for Sparse Networks

Panconesi, Alessandro and Rizzi, Romeo (2001) Some Simple Distributed Algorithms for Sparse Networks. UNSPECIFIED. (Unpublished)

[img]
Preview
 PDF
Download (661Kb) | Preview

    Abstract

    We give simple, deterministic, distributed algorithms for computing maximal matchings, maximal independent sets and colourings. We show that edge colourings with at most 2D-1 colours, and maximal matchings can be computed within O(log^* n + D) deterministic rounds, where D is the maximum degree of the network. We also show how to find maximal independent sets and (D+1)-vertex colourings within O(log^* n + D^2) deterministic rounds. All hidden constants are very small and the algorithms are very simple.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: distributed computing, sparse networks, maximal independent set, maximal matching, vertex colouring, edge colouring
    Additional Information: Published in Distributed Computing, vol. 14 (2001) 97-100
    Report Number: DIT-02-039
    Repository staff approval on: 21 Jan 2003

    Actions (login required)

    		 View Item