Graph Algorithms

Shortest paths, flows, matchings and cuts: the routines inside routers, compilers and schedulers.

Open problems, most leverage first

All open problems →

#VotesProblemWork mixDVLStatus

010Maximum clique of DIMACS graph C2000.9: find 81 or prove 80Bound / recordGraph benchmark suites: Graph500, GAP and the DIMACS challenge instances2 bottlenecks
6248OpenD 62V 4L 8▲ 0
020Graph500 BFS: exceed 410,266.553 GTEPS on a validated runReproductionGraph benchmark suites: Graph500, GAP and the DIMACS challenge instances2 bottlenecks
18226OpenD 18V 22L 6▲ 0

Research

Filter in Research →

Graph Algorithms</> 2 reposLibraryActive

Graph benchmark suites: Graph500, GAP and the DIMACS challenge instances

Standard graph workloads (Graph500 BFS and SSSP, the GAP Benchmark Suite, DIMACS clique instances) with fixed generators, validation and public result lists.

2 problems0 dependents0 maintainers