Distributed K-Distance Indexing Approach for Efficient Shortest Path Discovery on Large Graphs

Jihye Hong, Hyunwook Kim, Waqas Nawaz, Kisung Park, Byeong-Soo Jeong, Young-Koo Lee. Distributed K-Distance Indexing Approach for Efficient Shortest Path Discovery on Large Graphs. In Wook-Shin Han, Mong-Li Lee, Agus Muliantara, Ngurah Agus Sanjaya, Bernhard Thalheim, Shuigeng Zhou, editors, Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, International Workshops: BDMA, DaMEN, SIM - 3 - , UnCrowd; Bali, Indonesia, April 21-24, 2014, Revised Selected Papers. Volume 8505 of Lecture Notes in Computer Science, pages 75-88, Springer, 2014. [doi]

@inproceedings{HongKNPJL14,
  title = {Distributed K-Distance Indexing Approach for Efficient Shortest Path Discovery on Large Graphs},
  author = {Jihye Hong and Hyunwook Kim and Waqas Nawaz and Kisung Park and Byeong-Soo Jeong and Young-Koo Lee},
  year = {2014},
  doi = {10.1007/978-3-662-43984-5_6},
  url = {http://dx.doi.org/10.1007/978-3-662-43984-5_6},
  researchr = {https://researchr.org/publication/HongKNPJL14},
  cites = {0},
  citedby = {0},
  pages = {75-88},
  booktitle = {Database Systems for Advanced Applications - 19th International Conference, DASFAA 2014, International Workshops: BDMA, DaMEN, SIM - 3 - , UnCrowd; Bali, Indonesia, April 21-24, 2014, Revised Selected Papers},
  editor = {Wook-Shin Han and Mong-Li Lee and Agus Muliantara and Ngurah Agus Sanjaya and Bernhard Thalheim and Shuigeng Zhou},
  volume = {8505},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-43983-8},
}