Category
page 1Polynomial-time problems
minimum spanning tree
data structure, subgraph of a weighted graph
Bellman–Ford algorithm
algorithm for finding single-source shortest paths in graphs, allowing some edge weights to be negative
shortest path problem
problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized
Floyd–Warshall algorithm
algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
matching
set of edges without common vertices
longest common subsequence problem
the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible
edge cover
a set of edges that touches every vertex of a graph
assignment problem
combinatorial optimization problem
maximum subarray problem
the task of finding a contiguous subarray with the largest sum in a given array of numbers
widest path problem
problem of maximizing the weight of the minimum-weight edge in the path between two vertices