Faster algorithms for the minimum red-blue-purple spanning graph problem (Q2985117)
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 6715879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for the minimum red-blue-purple spanning graph problem |
scientific article; zbMATH DE number 6715879 |
Statements
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (English)
0 references
16 May 2017
0 references
RBP spanning graph
0 references
minimum RBP spanning graph problem
0 references
0.8373613357543945
0 references
0.8297244310379028
0 references
0.8001316785812378
0 references
0.7840350270271301
0 references
0.7812541127204895
0 references
