Graph Algorithms
Traversal, shortest paths, flows, matchings, connectivity, coloring, network science.
Topics
Problems attacked from this category
- All-pairs minimum cuts2
- All-pairs shortest paths3
- Any-angle pathfinding3
- Assignment2
- Bipartite matching2
- Boolean satisfiability1
- Bridges, cut vertices, and biconnectivity4
- Chordal graph recognition2
- Clique finding3
- Community detection4
- Contagion and influence spread modeling4
- Counting combinatorial structures1
- Degree sequence realization2
- Dense subgraph discovery3
- Dominator computation1
- Dynamic connectivity2
- Dynamic programming on trees1
- Edge bundling2
- Euler paths and circuits2
- Game solving and proof search2
- General graph matching2
- Graph comparison and classification1
- Graph diameter1
- Graph isomorphism3
- Graph layout12
- Graph partitioning4
- Graph representation learning4
- Graph traversal and uninformed search3
- Grid pathfinding8
- Hierarchy visualization3
- Incremental replanning4
- Independent sets2
- Influence maximization2
- Informed search under budgets6
- K shortest paths2
- Layered graph drawing4
- Link prediction4
- Lowest common ancestor3
- Maximum flow9
- Minimum cut3
- Minimum mean cycle2
- Minimum spanning tree5
- Minimum-cost flow4
- Multi-agent pathfinding2
- Node importance and link analysis9
- Node similarity and structural roles2
- Planarity and minor testing3
- Project scheduling1
- Puzzle-state search8
- Random graph generation6
- Real-time agent search2
- Region labeling and connected components1
- Road-network routing7
- Single-source shortest paths12
- Sparse matrix ordering5
- Stable matching and allocation1
- Steiner trees and network design2
- Strongly connected components3
- Subgraph and motif counting4
- Subgraph isomorphism2
- Tiling and matching counts1
- Topological ordering2
- Transitive closure and reduction2
- Tree drawing3
- Tree path and subtree decompositions2
- Vertex coloring8