## k most vital arcs in the shortest path problemCornell University, Johnson Graduate School of Management, 1988 - Technology & Engineering - 9 pages |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

algorithm to solve appropriate data structure arc disjoint s-t arc whose removal arcs with respect bound for Dijkstra’s complexity of ﬁnding computation Corley and Sha deﬁne deﬁnition deleted Dijkstra’s algorithm disjoint s-t paths E Q A exact algorithm ﬁnd ﬁnding the shortest FINDMIN ﬂow in G(V go from nodes Golden and Vohra graph with edge graph with non-negative greatest increase heap identiﬁed ifl(k inﬁnite kMostVitalArcs lc most vital max ﬂow maximum s-t ﬂow minimum cut minimum label node in F non-descending order non-negative arc lengths number of arc order of length path in G(V path in G(V,A\E paths are indexed polynomial bound problem instance problem of ﬁnding proof for Result propose an exact s-t cut sequentially shortest distance shortest path problem shortest s-t path single most vital solve the lc solve the single speciﬁed nodes subset of arcs tree of shortest undirected graph upper bound Vita.lDist vital arc problem