Efficient Maintenance of Shortest Distances in Dynamic Graphs
Sign Up to like & getrecommendations! Published in 2018 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2017.2772233
Abstract: Computing shortest distances is a central task in many domains. The growing number of applications dealing with dynamic graphs calls for incremental algorithms, as it is impractical to recompute shortest distances from scratch every time… read more here.
Keywords: distances dynamic; efficient maintenance; maintenance shortest; dynamic graphs ... See more keywords