Computing all-pairs shortest paths by leveraging low treewidth (Q2887076)
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: Computing all-pairs shortest paths by leveraging low treewidth |
scientific article; zbMATH DE number 6035679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing all-pairs shortest paths by leveraging low treewidth |
scientific article; zbMATH DE number 6035679 |
Statements
16 May 2012
0 references
directed graphs
0 references
all-pairs shortest paths
0 references
efficient algorithms
0 references
0.8833681
0 references
0 references
0 references
0.8697835
0 references
0.86796534
0 references
0.8673224
0 references
0.8625018
0 references
0.8594817
0 references
Computing all-pairs shortest paths by leveraging low treewidth (English)
0 references
