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
From the Graph Atlas:
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

Source: Albert, Réka - Departments of Biology & Physics, Pennsylvania State University

Collections: Biology and Medicine