An optimal maximal independent set algorithm for bounded-independence graphs (Q992507): 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:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal maximal independent set algorithm for bounded-independence graphs |
scientific article |
Statements
An optimal maximal independent set algorithm for bounded-independence graphs (English)
0 references
9 September 2010
0 references
ad hoc network
0 references
sensor network
0 references
radio network
0 references
unit disk graph
0 references
growth bounded graph
0 references
bounded-independence graph
0 references
local algorithm
0 references
parallel algorithm
0 references
maximal independent set
0 references
maximal matching
0 references
dominating set
0 references
connected dominating set
0 references
coloring
0 references
symmetry breaking
0 references
