scientific article; zbMATH DE number 124663

MaRDI QIDQ4026306zbMATH OpenFDO

Authors Gilles Bertrand

Publication date 21 February 1993

zbMATH Keywords

lengths of shortest pathslinear algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35)

Recommendations

• Computing the nxm shortest path efficiently
• Computing shortest paths in networks derived from recurrence relations
• Computing almost shortest paths
• Computing almost shortest paths (extended abstract)
• scientific article; zbMATH DE number 3876620
• scientific article; zbMATH DE number 176745
• Computing homotopic shortest paths efficiently
• scientific article; zbMATH DE number 1947410
• scientific article; zbMATH DE number 2079391
• scientific article; zbMATH DE number 1256695

Cited in

(5)

• The shortest path problem for the distant graph of the projective line over the ring of integers
• Graph transformation approach for the shortest path search and length calculation
• Shortest path algorithm for some graphs before and after folding
• scientific article; zbMATH DE number 3876620 (Why is no real title available?)
• An algorithm for finding the number of shortest routes on square lattices

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 Q4026306)