Fast RNC and NC algorithms for maximal path sets (Q1285573)
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 1281074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast RNC and NC algorithms for maximal path sets |
scientific article; zbMATH DE number 1281074 |
Statements
Fast RNC and NC algorithms for maximal path sets (English)
0 references
28 April 1999
0 references
parallel algorithms
0 references
randomized parallel algorithms
0 references
graph algorithms
0 references
maximal path sets
0 references
approximation algorithms
0 references
shortest common superstrings
0 references
0.8882862
0 references
0.8765143
0 references
0.85660493
0 references
0.85635287
0 references
0.8557611
0 references
0.8519213
0 references
0.85104007
0 references
0.85093313
0 references
