A log-star distributed maximal independent set algorithm for growth-bounded graphs (Q2934330)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6379940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A log-star distributed maximal independent set algorithm for growth-bounded graphs |
scientific article; zbMATH DE number 6379940 |
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
0.9285776
0 references
0.8782672
0 references
0.8686271
0 references
0.8647548
0 references
0.8641417
0 references
0.85934985
0 references
0.8590826
0 references
0.8572898
0 references
