Computing strictly-second shortest paths (Q287170): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3619797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the k Shortest Paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The directed subgraph homeomorphism problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the spanning trees of weighted graphs / rank | |||
Normal rank | |||
Latest revision as of 01:08, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing strictly-second shortest paths |
scientific article |
Statements
Computing strictly-second shortest paths (English)
0 references
26 May 2016
0 references
shortest paths
0 references
\(k\)-shortest paths
0 references
