Longest Trail Problem
Let us consider a graph with n vertexes and m edges. The problem is to search the longest edge-simple path. Here edge-simple means no edge occurs in the path twice, but vertexes can occur several times. The longest means the path has the maximal possible number of edges.
Parameters
- : number of vertices
- : number of edges
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