Improved sliding shortest path algorithm: performance analysis

MaRDI QIDQ3110118zbMATH OpenFDO

Authors Henry Carter, Ramesh Bhandari

Publication date 26 January 2012

zbMATH Keywords

minimal edge weight changes.network optimization, performance analysisshortest path algorithmweighted graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The improved sliding shortest path algorithm
• Shortest paths in a lattice network: A comparative study
• A constrained minimum cost s-t cutset problem
• scientific article; zbMATH DE number 4187850
• Shortest paths in stochastic networks with ARC lengths having discrete distributions

Cited in

(4)

• The improved sliding shortest path algorithm
• Shortest paths in stochastic networks with ARC lengths having discrete distributions
• Shortest paths in a lattice network: A comparative study
• Distance-preserving graph compression techniques

This page was built for publication: Improved sliding shortest path algorithm: performance analysis

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