Efficient single-pair all-shortest-path query processing for massive dynamic networks
type: Item
instance of: scholarly article
title: Efficient single-pair all-shortest-path query processing for massive dynamic networks
zbMATH Open document ID: 1475.68114
author: Sun Geol Baek
author: Sungkil Lee
author: Young Ik Eom
published in: Information Sciences
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7436910
zbMATH Keywords: graph query processing
zbMATH Keywords: shortest paths
zbMATH Keywords: incremental maintenance
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
full work available at URL: j.ins.2020.08.111
OpenAlex ID: W3087919015
cites work: Computing source-to-target shortest paths for complex networks in RDBMS
cites work: On a routing problem
cites work: Reachability and Distance Queries via 2-Hop Labels
cites work: Q3651735
cites work: A note on two problems in connexion with graphs
cites work: Finding the k Shortest Paths
cites work: Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm
cites work: Computing all-pairs shortest paths by leveraging low treewidth
cites work: A new approach to all-pairs shortest paths on real-weighted graphs
cites work: A Theorem on Boolean Matrices
cites work: Faster all-pairs shortest paths via circuit complexity
cites work: Finding the K Shortest Loopless Paths in a Network
DOI: 10.1016/J.INS.2020.08.111
Recommended article: Q5212359
Recommended article: Dynamic approximate all-pairs shortest paths in undirected graphs
Recommended article: Shortest-path queries in static networks
Recommended article: A single-source shortest path algorithm for dynamic graphs
Recommended article: Q3574266
Recommended article: A new approach to dynamic all pairs shortest paths
Recommended article: Adjacency queries in dynamic sparse graphs
Recommended article: Q4737195
description: scientific article; zbMATH DE number 7436910