 
Summary: Graph Processing
István Albert
Bioinformatics Consulting Center
Huck Institute for Life Sciences
Part 1
Representations and Algorithms
Graph Processing
ˇ Compute some static value of the graph
degree distribution, clustering coefficient
ˇ Identify some subset of edges or vertices
shortest path, spanning tree, connected
components
Not easy to write
ˇ The Challenge of Binary Search  it took
more than 10 years to publish the first
correct binary search
ˇ Graph algorithms are difficult to test for
correctness
The Big Oh
Represents the complexity of a worst case
