An all-pairs shortest path algorithm for bipartite graphs (Q469055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6367280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An all-pairs shortest path algorithm for bipartite graphs |
scientific article; zbMATH DE number 6367280 |
Statements
An all-pairs shortest path algorithm for bipartite graphs (English)
0 references
10 November 2014
0 references
bipartite graph
0 references
tropical (MIN-plus) algebra
0 references
shortest path
0 references
distance matrix product
0 references
0 references
0.7690376043319702
0 references
0.7684510946273804
0 references
0.7657562494277954
0 references
0.7657562494277954
0 references
0.7616386413574219
0 references
