scientific article; zbMATH DE number 3974765

MaRDI QIDQ3741464zbMATH OpenFDO

Authors Yuyuan Qin

Publication date 1984

zbMATH Keywords

eddy cyclejar-metricshortest paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Programming involving graphs or networks (90C35) Programming in abstract spaces (90C48)

Recommendations

• Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem
• Shortest path algorithms using dynamic breadth‐first search
• On the optimality of Bellman-Ford-Moore shortest path algorithm
• Path problems in networks
• scientific article; zbMATH DE number 4076996

Cited in

(6)

• Application of the Floyd algorithm to the asymptotic analysis of networks with unreliable ribs
• scientific article; zbMATH DE number 4008140 (Why is no real title available?)
• scientific article; zbMATH DE number 1775510 (Why is no real title available?)
• scientific article; zbMATH DE number 3999136 (Why is no real title available?)
• Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem
• On a general -algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741464)