On finding shortest paths in nonnegative networks

DOI10.1016/0012-365X(74)90027-2zbMath0297.05121MaRDI QIDQ1213884

S. Singh

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

Reduktion von Präzedenzstrukturen

Cites Work

• All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
• Unnamed Item
• Unnamed Item

This page was built for publication: On finding shortest paths in nonnegative networks