An optimal maximal independent set algorithm for bounded-independence graphs (Q992507)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal maximal independent set algorithm for bounded-independence graphs |
scientific article; zbMATH DE number 5781472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal maximal independent set algorithm for bounded-independence graphs |
scientific article; zbMATH DE number 5781472 |
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
0 references
0 references
0 references
0.9441818
0 references
0 references
0.93310237
0 references
0.9251919
0 references
