Fast RNC and NC algorithms for maximal path sets (Q1285573): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(97)00132-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015387196 / rank | |||
Normal rank | |||
Latest revision as of 10:51, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast RNC and NC algorithms for maximal path sets |
scientific article |
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
