A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs
Open access
Date
2007Type
- Report
ETH Bibliography
yes
Altmetrics
Permanent link
https://doi.org/10.3929/ethz-a-006785948Publication status
publishedJournal / series
Technical report / Departement Informatik, ETH ZürichVolume
Publisher
ETH Zürich, Computer Science Department, Institute for Theoretical Computer ScienceSubject
DISTRIBUTED ALGORITHMS + PARALLEL ALGORITHMS (PROGRAMMING METHODS); GRAPHENALGORITHMEN + GEOMETRISCHE ALGORITHMEN (GRAPHENTHEORIE); VERTEILTE ALGORITHMEN + PARALLELE ALGORITHMEN (PROGRAMMIERMETHODEN); Distributed algorithms; Graph algorithms; GRAPH ALGORITHMS + GEOMETRIC ALGORITHMS (GRAPH THEORY)Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science
Notes
Technical Reports D-INFK. See also http://e-citations.ethbib.ethz.ch/view/pub:17239.More
Show all metadata
ETH Bibliography
yes
Altmetrics