A log-star distributed maximal independent set algorithm for growth-bounded graphs (Q2934330): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:15, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A log-star distributed maximal independent set algorithm for growth-bounded graphs |
scientific article |
Statements
A log-star distributed maximal independent set algorithm for growth-bounded graphs (English)
0 references
12 December 2014
0 references
ad hoc networks
0 references
coloring
0 references
\textsc{Connected Dominating Sets}
0 references
dominating sets
0 references
growth bounded graphs
0 references
local algorithms
0 references
\textsc{Maximal Independent Set}
0 references
parallel algorithms
0 references
radio networks
0 references
sensor networks
0 references
symmetry breaking
0 references
unit disk graphs
0 references
