longest s-t path problem
Given a weighted directed or undirected graph G = (V,E,w), source and terminal vertices s and t, and a number k, find the path of maximum weight that visits k distinct vertices in V, starting at s and ending at t.
Parameters
- : number of vertices
- : number of edges
- : number of vertices in path
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table