<--- Back to Details
First PageDocument Content
NP-complete problems / Graph connectivity / Combinatorial optimization / Graph coloring / Neighbourhood / Connected component / Tree / Graph / Vertex / Graph theory / Mathematics / Theoretical computer science
Date: 2014-01-10 18:29:06
NP-complete problems
Graph connectivity
Combinatorial optimization
Graph coloring
Neighbourhood
Connected component
Tree
Graph
Vertex
Graph theory
Mathematics
Theoretical computer science

Optimizing Graph Algorithms on Pregel-like Systems ∗ Semih Salihoglu

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

Download Document from Web Archive

File Size: 578,98 KB