I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study

Deepak Ajwani, Andreas Beckmann, Ulrich Meyer, David Veith. I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. In Gero Mühl, Jan Richling, Andreas Herkersdorf, editors, ARCS 2012 Workshops, 28. Februar - 2. März 2012, München, Germany. Volume 200 of LNI, pages 493-504, GI, 2012. [doi]

Abstract

Abstract is missing.