A novel shortest path query algorithm

No abstract is available for this paper.

• Publication year

  2019

• Venue

  Cluster Computing

• Publication date

  2019-05-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s10586-018-2554-8
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Most Influential Community Search over Large Social Networks

  2017cited by this paper
• A Survey of Shortest-Path Algorithms

  2017cited by this paper
• V-Tree: Efficient kNN Search on Moving Objects with Road-Network Constraints

  2017cited by this paper
• DAG Reduction: Fast Answering Reachability Queries

  2017cited by this paper
• The Moving K Diversified Nearest Neighbor Query

  2016cited by this paper
• Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks

  2016cited by this paper
• Semantic Web in data mining and knowledge discovery: A comprehensive survey

  2016cited by this paper
• An Efficient Approach to Generating Location-Sensitive Recommendations in Ad-hoc Social Network Environments

  2015cited by this paper
• Efficient continuous top-k spatial keyword queries on road networks

  2014cited by this paper
• Efficient algorithm for reverse furthest neighbor in spatial databases

  2013cited by this paper
• Fast exact shortest-path distance queries on large networks by pruned landmark labeling

  2013cited by this paper
• Top-K Nearest Keyword Search on Large Graphs

  2013cited by this paper
• Discovering Patterns in Social Networks with Graph Matching Algorithms

  2013cited by this paper
• IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying

  2012cited by this paper
• Data and text mining SAGA : a subgraph matching tool for biological graphs

  2007cited by this paper
• Efficient keyword search for smallest LCAs in XML databases

  2005cited by this paper
• Monitoring k-nearest neighbor queries over moving objects

  2005cited by this paper
• Gaining confidence in high-throughput protein interaction networks

  2004cited by this paper
• HKBU Institutional Repository

  2002cited by this paper
• Efficient Algorithms for Shortest Paths in Sparse Networks

  1977cited by this paper
• A Formal Basis for the Heuristic Determination of Minimum Cost Paths

  1968cited by this paper
• A note on two problems in connexion with graphs

  1959cited by this paper
• ON A ROUTING PROBLEM

  1958cited by this paper

• A path planning method based on the particle swarm optimization trained fuzzy neural network algorithm

  2021cites this paper
• A Single Source Optimal Reachable Path Query Method for Gene Regulatory Network

  2021cites this paper
• Novel best path selection approach based on hybrid improved A* algorithm and reinforcement learning

  2021cites this paper