Journals
Publish with us
Publishing partnerships
About us
Blog
Complexity
Journal overview
For authors
For reviewers
For editors
Table of Contents
Special Issues
Complexity
/
2019
/
Article
/
Fig 3
/
Research Article
Finding the Shortest Path with Vertex Constraint over Large Graphs
Figure 3
An example of an approximate path.
(a)
Query graph
(b)
Minimum spanning tree
(c)
Preorder traversal of
(d)
Approximate path