Category:Polynomial-time problems

From Wikipedia, the free encyclopedia

You have new messages (last change).

This category is for combinatorial optimization problems solvable in polynomial time.

Pages in category "Polynomial-time problems"

There are 10 pages in this section of this category.

B

E

Element uniqueness problem

F

Floyd-Warshall algorithm

K

Kruskal's algorithm

L

Longest common subsequence problem

M

Minimum spanning tree

P

Prim's algorithm

R

Reverse-delete algorithm

S

Shortest path problem

Retrieved from "http://en.wikipedia.org../../../p/o/l/Category%7EPolynomial-time_problems_3f3d.html"

Category: Computational problems

Views

interaction

Search

In other languages