Eppstein's algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

After US mathematician David Eppstein (born 1963).

Proper noun[edit]

Eppstein's algorithm

  1. (graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph.