scientific article; zbMATH DE number 6469167

MaRDI QIDQ5501281zbMATH OpenFDO

Authors Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano

Publication date 3 August 2015

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Programming involving graphs or networks (90C35)

Recommendations

• Experimental analysis of dynamic all pairs shortest path algorithms
• A new approach to dynamic all pairs shortest paths
• Power balance and apportionment algorithms for the United States Congress
• An all pairs shortest path algorithm for dynamic graphs
• A new approach to dynamic all pairs shortest paths
• Dynamic approximate all-pairs shortest paths in undirected graphs
• scientific article; zbMATH DE number 2086658
• scientific article; zbMATH DE number 1043917
• scientific article; zbMATH DE number 1926665
• Fully dynamic all-pairs shortest paths: breaking the O(n) barrier

Cited in

(6)

• Algorithmic techniques for maintaining shortest routes in dynamic networks
• Experimental analysis of dynamic all pairs shortest path algorithms
• A new approach to dynamic all pairs shortest paths
• Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?
• Power balance and apportionment algorithms for the United States Congress
• Dynamic shortest paths and transitive closure: algorithmic techniques and data structures

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