Finding the <i>k</i> shortest simple paths (Q4962685): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1145/1290672.1290682 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W4376522482 / rank | |||
Normal rank |
Latest revision as of 20:02, 19 March 2024
scientific article; zbMATH DE number 6972843
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding the <i>k</i> shortest simple paths |
scientific article; zbMATH DE number 6972843 |
Statements
Finding the <i>k</i> shortest simple paths (English)
0 references
5 November 2018
0 references
loop-free paths
0 references
directed paths
0 references
path equivalence class
0 references
replacement paths
0 references