Finding the Shortest Path with Vertex Constraint over Large Graphs

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/complexity/volume-2019/8728245/figures/8728245.fig.001a.svgz" name="8728245.fig.001a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>Undirected graph</td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/complexity/volume-2019/8728245/figures/8728245.fig.001b.svgz" name="8728245.fig.001b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Shortest path</td></tr></table>

<div>An example of the shortest path with vertex constraint.</div>

Complexity

fig1

Figure 1

Figure 1: Finding the Shortest Path with Vertex Constraint over Large Graphs 