Concepedia

A faster computation of the most vital edge of a shortest path

Enrico Nardelli, Guido Proietti, Peter Widmayer

Information Processing Letters · 2001 · 94 citations · 6 references

DOI

Concepts

References

6

Applications of Path Compression on Balanced Trees

Robert E. Tarjan · Journal of the ACM · 1979 · 300 citations · Full text

, , +6

A note on finding the bridges of a graph

Robert E. Tarjan · Information Processing Letters · 1974 · 233 citations

, , +8

The k most vital arcs in the shortest path problem

Kavindra Malik, Aman Mittal, Sanjeev Gupta · Operations Research Letters · 1990 · 152 citations

, , +9

The k most vital arcs in the shortest path problem

Kavindra Malik, Ashok Mittal, Sanjeev Gupta · Operations Research Letters · 1989 · 149 citations

, , +9

Floats, Integers, and Single Source Shortest Paths

Mikkel Thorup · Journal of Algorithms · 2000 · 75 citations

, , +12