Finding the shortest path with vertex constraint over large graphs

DOI10.1155/2019/8728245zbMath1420.05171OpenAlexW2918100086MaRDI QIDQ2325209

Zhongfei Li, Xin Wang, Yajun Yang, Qinghua Hu

Publication date: 9 September 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/8728245

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
• Advances in Combinatorial Optimization

This page was built for publication: Finding the shortest path with vertex constraint over large graphs