Problem of finding the longest simple path for a given graph
In graph theory and theoretical computer science, the longest path problem is the problem of finding a simple path of maximum length in a given graph. A path is called simple if it does not have any repeated vertices; the length of a path may either be measured by its number of edges, or (in weighted graphs) by the sum of the weights of its edges. In contrast to the shortest path problem, which can be solved in polynomial time in graphs without negative-weight cycles, the longest path problem is NP-hard and the decision version of the problem, which asks whether a path exists of at least some given length, is NP-complete. This means that the decision problem cannot be solved in polynomial time for arbitrary graphs unless P = NP. Stronger hardness results are also known showing that it is difficult to approximate. However, it has a linear time solution for directed acyclic graphs, which has important applications in finding the critical path in scheduling problems.
and 20 Related for: Longest path problem information
In graph theory, the shortest pathproblem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights...
substructure. Longest common subsequence problemLongest increasing subsequence Longest palindromic substring All-Pairs Shortest Path Any problem that can...
longest common substring: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The problem...
Hamiltonian path. The computational problems of determining whether such paths and cycles exist in graphs are NP-complete; see Hamiltonian pathproblem for details...
computational complexity of the problem; see Hamiltonian pathproblem. Another related problem is the bottleneck travelling salesman problem: Find a Hamiltonian cycle...
The problem of finding the longest induced path or cycle in a hypercube, first posed by Kautz (1958), is known as the snake-in-the-box problem, and it...
minimum spanning tree of a set of points in the plane Longestpathproblem: find a simple path of maximum length in a given graph Minimum spanning tree...
Motion planning, also path planning (also known as the navigation problem or the piano mover's problem) is a computational problem to find a sequence of...
identify its longest series of dependent activities (its longestpath). These tools can display the critical path (and near-critical path activities if...
take a team of workers to perform the task. The longestpath in this DAG represents the critical path of the project, the one that controls the total...
algorithms for the longest decreasing subsequence problem. Conversely, every instance of the longest decreasing subsequence problem can be described equivalently...
resulting matrix describes the longestpath distances in the graph. Sorting the vertices by the lengths of their longest incoming paths produces a topological...
its vertex-deleted subgraphs. The snake-in-the-box problem: what is the longest possible induced path in an n {\displaystyle n} -dimensional hypercube graph...
particle path of an ideal fluid on a three dimensional domain eventually reaches a certain region in space. Lists of problems List of unsolved problems Reduction...
Induced paths are induced subgraphs that are paths. The shortest path between any two vertices in an unweighted graph is always an induced path, because...
different shortest paths. From every arbitrary distribution of disks, there are one or two different longest non-self-crossing paths to move all disks...
the critical path and if any activities have slack. The critical path is the path that takes the longest to complete. To determine the path times, add the...
pieces of the chessboard. A famous such problem is the knight's tour, in which one is to determine the path of a knight that visits each square of the...
Global Information