A log-star distributed maximal independent set algorithm for growth-bounded graphs (Q2934330): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1400751.1400758 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997707549 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:13, 19 March 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
