Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656): Difference between revisions
From MaRDI portal
Latest revision as of 10:19, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving the shortest-paths problem on bipartite permutation graphs efficiently |
scientific article |
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