P-completeness Compendium

Home
Problems
About

RNC

0–1 Maximum Flow
Blocking Flow in a Three Layered Network
Directed or Undirected Depth-first Search
Edge Coloring
Maximal Path
Maximum Disjoint Paths
Maximum Matching
Perfect Matching Existence
Subtree Isomorphism

P-completeness Compendium
A collaborative resource for parallel complexity theory.

Created by Yan Couto, open to contributions on GitHub.