NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NC algorithms for finding a maximal set of paths with application to compressing strings |
scientific article; zbMATH DE number 6999424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8882862
0 references
0.8584734
0 references
0.8584734
0 references
0.8530047
0 references
0.8470756
0 references
0.84512025
0 references
0.83985627
0 references
0 references
0.83826935
0 references
