Revisiting a randomized algorithm for the minimum rainbow subgraph problem (Q501008)
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: Revisiting a randomized algorithm for the minimum rainbow subgraph problem |
scientific article; zbMATH DE number 6492065
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Revisiting a randomized algorithm for the minimum rainbow subgraph problem |
scientific article; zbMATH DE number 6492065 |
Statements
Revisiting a randomized algorithm for the minimum rainbow subgraph problem (English)
0 references
8 October 2015
0 references
randomized algorithm
0 references
minimum rainbow subgraph
0 references
0 references
0.9530246
0 references
0.94857717
0 references
0 references
0.93666875
0 references
0 references
0.91810024
0 references
0.91810024
0 references
0.9008457
0 references
