Shortest path queries in digraphs of small treewidth (Q4645182)
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: Shortest path queries in digraphs of small treewidth |
scientific article; zbMATH DE number 6999436
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest path queries in digraphs of small treewidth |
scientific article; zbMATH DE number 6999436 |
Statements
Shortest path queries in digraphs of small treewidth (English)
0 references
10 January 2019
0 references
short path
0 references
tree decomposition
0 references
dynamic algorithm
0 references
negative cycle
0 references
short path tree
0 references
0 references
0.9401643
0 references
0.9218149
0 references
0.9111654
0 references
0.90635335
0 references
0.9037529
0 references
0 references
0.89090526
0 references
0 references
