Approximately counting approximately-shortest paths in directed acyclic graphs (Q260255)
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: Approximately counting approximately-shortest paths in directed acyclic graphs |
scientific article; zbMATH DE number 6558702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximately counting approximately-shortest paths in directed acyclic graphs |
scientific article; zbMATH DE number 6558702 |
Statements
Approximately counting approximately-shortest paths in directed acyclic graphs (English)
0 references
21 March 2016
0 references
shortest paths
0 references
approximation algorithms
0 references
counting
0 references
0 references
0.9936515
0 references
0 references
0.91181976
0 references
0.91161793
0 references
0.90909207
0 references
0 references
0.90111226
0 references
0.8878996
0 references
0 references
