3 problems
Matching
Quadratic edge-count conjecture.
Logarithmic path-length conjecture. The expected maximum directed path length of the resulting task-dependency graph is
Edge-addition success-probability conjecture.
Quadratic edge-count conjecture.
Logarithmic path-length conjecture. The expected maximum directed path length of the resulting task-dependency graph is
Edge-addition success-probability conjecture.