Embedding Graphs for Shortest-Path Distance Predictions
Year: 2020
Type: dissertation
Abstract: Graph is an important data structure and is used in an abundance of real-world applications including navigation systems, social networks, and web search engines, just to name but a few.We study a classic graph problem -computing graph shortest-path distances.This problem has many applications, such as finding nearest neighbors for place of interest (POI) recommendation or social network friendship recommendation.To compute a shortest-path distance, traditional approaches traverse the graph to find the shortest path and return the path length.These approaches lack time efficiency over large Contents 1 Introduction 1.1 Background . . . . . .
Author: Zhuowei Zhao
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: University of New South Wales
OpenAlex ID: W3051020105
