Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions.
Shuo HanLei ZouJeffrey Xu YuPublished in: SIGMOD Conference (2018)
Keyphrases
- graph theory
- polynomial time complexity
- learning algorithm
- directed graph
- equivalence classes
- maximum flow
- worst case
- random walk
- structured data
- bipartite graph
- significant improvement
- dependency graph
- computational cost
- optimization problems
- parallel implementation
- partitioning algorithm
- strongly connected
- stable set
- real time