Shortest Path Problem - Related Problems

Related Problems

For shortest path problems in computational geometry, see Euclidean shortest path.

The travelling salesman problem is the problem of finding the shortest path that goes through every vertex exactly once, and returns to the start. Unlike the shortest path problem, which can be solved in polynomial time in graphs without negative cycles, the travelling salesman problem is NP-complete and, as such, is believed not to be efficiently solvable (see P = NP problem). The problem of finding the longest path in a graph is also NP-complete.

The Canadian traveller problem and the stochastic shortest path problem are generalizations where either the graph isn't completely known to the mover, changes over time, or where actions (traversals) are probabilistic.

The shortest multiple disconnected path is a representation of the primitive path network within the framework of Reptation theory.

The problems of recalculation of shortest paths arises if some graph transformations (e.g., shrinkage of nodes) are made with a graph.

The widest path problem seeks a path so that the minimum label of any edge is as large as possible.

Read more about this topic:  Shortest Path Problem

Famous quotes containing the words related and/or problems:

    The custard is setting; meanwhile
    I not only have my own history to worry about
    But am forced to fret over insufficient details related to large
    Unfinished concepts that can never bring themselves to the point
    Of being, with or without my help, if any were forthcoming.
    John Ashbery (b. 1927)

    I’m no good at being noble, but it doesn’t take much to see that the problems of three little people don’t amount to a hill of beans in this crazy world. Someday you’ll understand that.
    Julius J. Epstein, U.S. screenwriter, Philip Epstein, screenwriter, Howard Koch, screenwriter, and Michael Curtiz. Rick Blaine (Humphrey Bogart)