Improved algorithm for finding next-to-shortest paths (Q845719): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Guo-Liang Chen / rank | |||
| Property / author | |||
| Property / author: Guo-Liang Chen / rank | |||
Normal rank | |||
| 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.1016/j.ipl.2006.04.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052950624 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding next-to-shortest paths in a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing strictly-second shortest paths / rank | |||
Normal rank | |||
Latest revision as of 10:53, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithm for finding next-to-shortest paths |
scientific article |
Statements
Improved algorithm for finding next-to-shortest paths (English)
0 references
29 January 2010
0 references
graph algorithms
0 references
computational complexity
0 references
shortest paths
0 references
