A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086)
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 6012835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs |
scientific article; zbMATH DE number 6012835 |
Statements
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (English)
0 references
7 March 2012
0 references
distributed algorithm
0 references
self-stabilization
0 references
graph algorithm
0 references
independence
0 references
domination
0 references
coloring
0 references
matching
0 references
0 references
0 references
0 references
0 references
0.8409909009933472
0 references
0.8017390966415405
0 references
0.7967542409896851
0 references
0.7914358377456665
0 references
