NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Sequential and Parallel Approximation of Shortest Superstrings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On finding minimal length superstrings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A greedy approximation algorithm for constructing shortest common superstrings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for the shortest common superstring problem / rank | |||
Normal rank | |||
Latest revision as of 20:26, 17 July 2024
scientific article; zbMATH DE number 6999424
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NC algorithms for finding a maximal set of paths with application to compressing strings |
scientific article; zbMATH DE number 6999424 |
Statements
NC algorithms for finding a maximal set of paths with application to compressing strings (English)
0 references
10 January 2019
0 references
approximation algorithm
0 references
compression ratio
0 references
undirected graph
0 references
approximation ratio
0 references
Hamiltonian path
0 references
