The Parallel Complexity of Graph Canonization Under Abelian Group Action.
Vikraman ArvindJohannes KöblerPublished in: Algorithmica (2013)
Keyphrases
- depth first search
- worst case
- parallel processing
- parallel implementation
- graph theory
- directed graph
- joint action
- graph model
- random walk
- computational complexity
- decision problems
- bipartite graph
- graph structure
- weighted graph
- computational cost
- graph representation
- social networks
- parallel programming
- bounded treewidth
- graph based algorithm
- search engine