Expressing graph algorithms using generalized active messages.
Nicholas Gerard EdmondsJeremiah WillcockAndrew LumsdainePublished in: ICS (2013)
Keyphrases
- graph theory
- theoretical analysis
- computational cost
- orders of magnitude
- optimization problems
- computationally efficient
- significant improvement
- learning algorithm
- times faster
- benchmark datasets
- partitioning algorithm
- maximum flow
- graph search
- depth first search
- graph theoretic
- combinatorial optimization
- pairwise
- computational complexity
- data structure