The subtree max gap problem with application to parallel string covering (Q2508342)
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 5061591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The subtree max gap problem with application to parallel string covering |
scientific article; zbMATH DE number 5061591 |
Statements
The subtree max gap problem with application to parallel string covering (English)
0 references
10 October 2006
0 references
0.7821836471557617
0 references
0.7579141855239868
0 references
0.7561371326446533
0 references
