Finding the 'Needle': Locating Interesting Nodes Using the K-shortest Paths Algorithm in MapReduce


Understanding how nodes interconnect in large graphs is an important problem in many fields. We wish to find connecting nodes between two nodes or two groups of source nodes. In order to find these connecting nodes in huge graphs, we have devised a highly parallelized variant of a k-shortest path algorithm that levies the power of the Hadoop distributed… (More)
DOI: 10.1109/ICDMW.2011.84

5 Figures and Tables


  • Presentations referencing similar topics