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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

function continuous knapsack problem Cook reduction Cook's theorem counting sort covering CRCW Crew (algorithm) critical path problem CSP (communicating sequential...

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

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

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

different shortest paths. From every arbitrary distribution of disks, there are one or two different longest non-self-crossing paths to move all disks...

small world problem. An alternative view of the problem is to imagine the population as a social network and attempt to find the average path length between...

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

computer science, such as the lowest common ancestor problem and the longest common prefix problem (LCP). Given an array A[1 … n] of n objects taken from...