Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Graph Processing Istvn Albert
 

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

  

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

 

Collections: Biology and Medicine