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...

vertex-disjoint paths of length at most k. Glossary of graph theory Path graph Polygonal chain Shortest path problem Longest path problem Dijkstra's algorithm...

shortest path problem. A* search algorithm Bellman–Ford algorithm Euclidean shortest path Floyd–Warshall algorithm Johnson's algorithm Longest path problem Parallel...

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights...

path problem, directed and undirected.: GT37, GT38, GT39  Induced subgraph isomorphism problem Graph intersection number: GT59  Longest path problem: ND29 ...

substructure. Longest common subsequence problem Longest increasing subsequence Longest palindromic substring All-Pairs Shortest Path Any problem that can...

The longest uncrossed (or nonintersecting) knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally...

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...

identify its longest series of dependent activities (its longest path). These tools can display the critical path (and near-critical path activities if...

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 path problem for details...

minimum spanning tree of a set of points in the plane Longest path problem: find a simple path of maximum length in a given graph Minimum spanning tree...

boards. The knight's tour problem is an instance of the more general Hamiltonian path problem in graph theory. The problem of finding a closed knight's...

computational complexity of the problem; see Hamiltonian path problem. Another related problem is the bottleneck travelling salesman problem: Find a Hamiltonian cycle...

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...

finding the longest possible induced path in a hypercube; it can be viewed as a special case of the induced subgraph isomorphism problem. There is a similar...

algorithms for the longest decreasing subsequence problem. Conversely, every instance of the longest decreasing subsequence problem can be described equivalently...

optimization problem Minimum vertex cover Maximum clique Longest simple path Graph coloring; an application: register allocation in compilers Lists of problems List...

shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but...

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...

resulting matrix describes the longest path distances in the graph. Sorting the vertices by the lengths of their longest incoming paths produces a topological...

take a team of workers to perform the task. The longest path in this DAG represents the critical path of the project, the one that controls the total...

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...

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...

is of length at least s. Longest increasing subsequence problem Erdős, Paul; Szekeres, George (1935), "A combinatorial problem in geometry", Compositio...

through the Holland Tunnel. The 81-day strike was the longest in PATH's history. Substantial growth in PATH ridership during the 1980s required expansion and...

Determining if a particle path of an ideal fluid on a three dimensional domain eventually reaches a certain region in space. The problem of determining if a...

tradition, Peter headed the church for 35 years, and has thus far been the longest-reigning pope in the history of the Catholic Church. Nowadays, the newly...

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...