Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
Revision as of 15:44, 28 February 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
