-
Notifications
You must be signed in to change notification settings - Fork 26
Open
Labels
Description
- Graph coloring (Requester: Aydin)
- Maximal independent set (no requester)
- Minimum spanning tree (Requester: Scientist at NVIDIA, for computer vision)
- Strongly connected components (no requester)
- Weakly connected components (no requester)
- Triangle counting (no requester)
- Topological sort using direction-optimization and (logical_and, logical_and semiring) (no requester)