Title of article

Finding next-to-shortest paths in a graph

Author/Authors

I. Krasikov، نويسنده , , S.D. Noble، نويسنده ,

Issue Information

دوهفته نامه با شماره پیاپی سال 2004

Pages

3

From page

117

To page

119

Keywords

computational complexity , graph algorithms , shortest paths

Journal title

Information Processing Letters

Serial Year

2004

Journal title

Information Processing Letters

Record number

129977