Abstract: We study discrete cubical homology and algorithms that compute discrete homology groups of graphs. We first survey the existing state of the art algorithms and discuss applications of discrete homology. We then develop the fastest known algorithms for computing the first and second discrete homology groups of graphs and outline a future research program to develop similar algorithms in higher homology degrees.