과제정보
연구 과제 주관 기관 : 한국연구재단
참고문헌
- Akiba, Takuya, Yoichi Iwata, and Yuichi Yoshida, "Fast exact shortest-path distance queries on large networks by pruned landmark labeling," Proc. of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 349-360, Jun. 2013.
- Lingkun Wu, Xiaokui Xiao, et al., "Shortest path and distance queries on road networks: An experimental evaluation," Proc. of the VLDB Endowment, Vol. 5, Issue. 5, pp. 406-417, Jan. 2012.
- Konstantin Tretyakov, Abel Armas-Cervantes, et al., "Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs," Proc. of the 20th ACM international conference on Information and knowledge management, pp. 1785-1794, Oct. 2011.
- Michael Rice and Vassilis J. Tsotras, "Graph indexing of road networks for shortest path queries with label restrictions," Proc. of the VLDB Endowment, Vol. 4, Issue. 2, pp. 69-80, Nov. 2010.
- Saket Navlakha, Rajeev Rastogi and Nisheeth Shrivastava, "Graph summarization with bounded error," Proc. of the 2008 ACM SIGMOD international conference on Management of data, pp. 419-432, Jun. 2008.
- Kifayat Ullah Khan, Waqas Nawaz and Young-Koo Lee, "Set-based approximate approach for lossless graph summarization," Computing, Vol. 97, Issue. 12, pp. 1185-1207, Dec. 2015. https://doi.org/10.1007/s00607-015-0454-9
- Danai Koutra, U Kang, Jilles Vreeken and Christos Faloutsos, "VoG: summarizing and understanding large graphs," Proc. of the 2014 SIAM international conference on data mining, pp. 91-99, Jun. 2014.
- HoJin Seo, Hyunwook Kim, Kisung Park, Yongkoo Han, Young-Koo Lee, "Summarization Technique on a Compressed Graph for Massive Graph Analysis," Korean Society for Big Data Service, Vol. 2, No. 1, pp. 25-35, 2015.
- K. Wu, E. J. Otoo, A. Shosahni, H. Nordberg, "Notes on Design and Implementation of Compressed Bit Vectors," Lawrence Berkeley National Laboratory, 2001.
- Large-scale real-world social graphs, http://snap.stanford.edu