Search
Search Results
-
Label-constrained shortest path query processing on road networks
Computing the shortest path between two vertices is a fundamental problem in road networks. Most of the existing works assume that the edges in the...
-
Learning to Predict Shortest Path Distance
As graph data emerging in various application e.g., biology, social network, scalable graph methods are required to analyze such data. However,...
-
Privacy Preserving Queries of Shortest Path Distances
Consider a user with a very limited hardware and internet connection who wants to query a shortest path distance from a web service, but doesn’t want...
-
Multi-constraint shortest path using forest hop labeling
The Multi-Constraint Shortest Path (MCSP) problem aims to find the shortest path between two nodes in a network subject to a given constraint set. It...
-
A new semi-local centrality for identifying influential nodes based on local average shortest path with extended neighborhood
Quantifying the importance of nodes in complex networks is known as the problem of identifying influential nodes and is considered a critical aspect...
-
Honey bees find the shortest path: a collective flow-mediated approach
Honey bees ( Apis mellifera L.) are social insects that makes frequent use of volatile pheromone signals to collectively navigate unpredictable and...
-
Optimizing Drone Navigation Using Shortest Path Algorithms
In modern agriculture, the use of agricultural drones (UAV) has gained significant popularity due to their ability to efficiently monitor and manage...
-
Query-Decision Regression Between Shortest Path and Minimum Steiner Tree
Considering a graph with unknown weights, can we find the shortest path for a pair of nodes if we know the minimal Steiner trees associated with some...
-
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks
Computing the shortest distance between two vertices is a fundamental problem in road networks. Since a direct search using the Dijkstra’s algorithm...
-
A Graph-Based Shortest Path Community Expansion Method
With the advent of the era of big data, research on community discovery has become more and more popular. For the division of nodes in the network,...
-
Algorithms for Shortest Path Tour Problem in Large-Scale Road Network
Carpooling route planning becomes an important problem with the growth of low-carbon traffic systems. When each passenger has several potential...
-
Building the Shortest Path Database in Urban Traffic Network Using RAO Algorithm
In urban environments, traffic networks are characterized by fixed distances between nodes, representing intersections or landmarks. Efficiently...
-
Lower Bounds for Non-adaptive Shortest Path Relaxation
We consider single-source shortest path algorithms that perform a sequence of relaxation steps whose ordering depends only on the input graph...
-
Script independent text segmentation of document images using graph network based shortest path scheme
Document image processing is one of the growing research fields in the digital world for applications like data base indexing, text recognition,...
-
A wave time-varying neural network for solving the time-varying shortest path problem
In this paper, we propose a wave time-varying neural network (WTNN) to solve the time-varying shortest path problem (TSPP). The complexity of the...
-
RGCNdist2vec: Using Graph Convolutional Networks and Distance2Vector to Estimate Shortest Path Distance Along Road Networks
Computing shortest distance estimation for road networks is an important component of map service systems. Existing embedded-based shortest path...
-
A Linear Time Algorithm for Linearizing Quadratic and Higher-Order Shortest Path Problems
An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest...
-
Shortest Paths
In state-space search the initial and the goal states are nodes in a graph. Edges between the nodes are labeled with cost. The task in single-source...
-
An Experimental Evaluation of Two Methods on Shortest Distance Queries over Small-World Graphs
Efficient computation of shortest distances is a fundamental problem in graph databases. In this paper, we report our experimental evaluation and...
-
A Comparison of Genetic Representations and Initialisation Methods for the Multi-objective Shortest Path Problem on Multigraphs
This paper compares different solution approaches for the multi-objective shortest path problem (MSPP) on multigraphs. Multigraphs as a modelling...
