Local computation algorithms for graphs of non-constant degrees (Q524360)
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: Local computation algorithms for graphs of non-constant degrees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Local computation algorithms for graphs of non-constant degrees |
scientific article |
Statements
Local computation algorithms for graphs of non-constant degrees (English)
0 references
2 May 2017
0 references
local computation algorithms
0 references
randomized algorithms
0 references
maximal independent set
0 references
maximum matching
0 references
0 references
0 references
0 references
0 references
0.890899658203125
0 references
0.881598174571991
0 references
0.8678396344184875
0 references
0.8234717845916748
0 references
0.8197290897369385
0 references
