Research Article
Finding the Shortest Path with Vertex Constraint over Large Graphs
| Symbol | Meaning |
| | An undirected weighted graph |
| | Starting vertex, ending vertex, vertex constraint |
| | Weight of edge , weight of path |
| | Shortest path between and with vertex constraint |
| | Permutation of a vertex subset |
| | Shortest path between and under permutation |
|
|