Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656)
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 985118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the shortest-paths problem on bipartite permutation graphs efficiently |
scientific article; zbMATH DE number 985118 |
Statements
Solving the shortest-paths problem on bipartite permutation graphs efficiently (English)
0 references
28 February 1997
0 references
Parallel algorithms
0 references
Shortest paths
0 references
Bipartite permutation graphs
0 references
Upper and lower bounds
0 references
0 references
0 references
0.8682494759559631
0 references
0.8616923689842224
0 references
0.8228120803833008
0 references
