摘要: … BFS tree, we also need to store for the first node u of each chunk the smallest index of a node v such that ( u , v ) belongs to the BFS … By virtue of the underlying BFS, we can implement a …
mdpi.com
sci-hub.se 参考文章(19)
Rajeev Motwani, Terry Winograd, Lawrence Page, Sergey Brin, The PageRank Citation Ranking : Bringing Order to the Web the web conference. ,vol. 98, pp. 161- 172 ,(1999)
T. Feder, R. Motwani, Clique Partitions, Graph Compression and Speeding-Up Algorithms Journal of Computer and System Sciences. ,vol. 51, pp. 261- 272 ,(1995) , 10.1006/JCSS.1995.1065
György Turán, On the succinct representation of graphs Discrete Applied Mathematics. ,vol. 8, pp. 289- 294 ,(1984) , 10.1016/0166-218X(84)90126-4
N.J. Larsson, A. Moffat, Offline dictionary-based compression data compression conference. pp. 296- 305 ,(1999) , 10.1109/DCC.1999.755679
Gregory Buehrer, Kumar Chellapilla, A scalable pattern mining approach to web graph compression with communities web search and data mining. pp. 95- 106 ,(2008) , 10.1145/1341531.1341547
Francisco Claude, Gonzalo Navarro, A Fast and Compact Web Graph Representation String Processing and Information Retrieval. pp. 118- 129 ,(2007) , 10.1007/978-3-540-75530-2_11
Speeding Up Algorithms on Compressed Web Graphs Internet Mathematics. ,vol. 6, pp. 373- 398 ,(2009) , 10.1080/15427951.2009.10390646
Paolo Boldi, Bruno Codenotti, Massimo Santini, Sebastiano Vigna, UbiCrawler: a scalable fully distributed web crawler Software - Practice and Experience. ,vol. 34, pp. 711- 726 ,(2004) , 10.1002/SPE.587
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan, On compressing social networks Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '09. pp. 219- 228 ,(2009) , 10.1145/1557019.1557049
Codes for the World Wide Web Internet Mathematics. ,vol. 2, pp. 407- 429 ,(2005) , 10.1080/15427951.2005.10129113