Efficient Single-Pair All-Shortest-Path Query Processing...

  • Main
  • 2020 / 9
  • Efficient Single-Pair All-Shortest-Path Query Processing...
Information Sciences 2020 / 9

Efficient Single-Pair All-Shortest-Path Query Processing for Massive Dynamic Networks

Geol Baek, Sun, Lee, Sungkil, Ik Eom, Young
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Journal:
Information Sciences
DOI:
10.1016/j.ins.2020.08.111
Date:
September, 2020
File:
PDF, 778 KB
2020
Conversion to is in progress
Conversion to is failed