Fully dynamic update of arc-flags

DOI10.1002/NET.21542zbMATH Open1390.90154OpenAlexW2049639176MaRDI QIDQ4642489FDOQ4642489

Authors: Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni 

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21542

Recommendations

• Arc-flags in dynamic graphs
• scientific article; zbMATH DE number 5734722
• Fully dynamic shortest paths in digraphs with arbitrary arc weights
• Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
• Shortest paths on dynamic graphs

zbMATH Keywords

shortest pathsroad networksspeed-up techniquesalgorithm engineeringdynamic algorithmsarc-flags

Mathematics Subject Classification ID

Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06) Communication networks in operations research (90B18)

Cited In (7)

• Fully Dynamic 2-Hop Cover Labeling
• Arc-flags in dynamic graphs
• Title not available (Why is that?)
• Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
• Engineering graph-based models for dynamic timetable information systems
• Distance Queries in Large-Scale Fully Dynamic Complex Networks
• Applying skeletons to speed up the Arc-Flags routing algorithm

This page was built for publication: Fully dynamic update of arc-flags

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