An Experimental Evaluation of Two Methods on Shortest Distance Queries over Small-World Graphs
Authors:
- 7 November 2023
- book chapter
- Published by Springer Nature
- p. 329-340
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Scaling Up Distance Labeling on Graphs with Core-Periphery Properties2020
- Scaling Distance Labeling on Small-World Networks2019
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphsJournal of Computer and System Sciences, 2016
- Fast exact shortest-path distance queries on large networks by pruned landmark labeling2013
- A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks2011
- The Minimum Degree Heuristic and the Minimal Triangulation Process2003