메뉴 건너뛰기




Volumn 7608 LNCS, Issue , 2012, Pages 264-276

Compressed representation of web and social networks via dense subgraphs

Author keywords

Compressed data structures; Social networks; Web graphs

Indexed keywords

DATA STRUCTURES; DIGITAL STORAGE; INFORMATION RETRIEVAL;

EID: 84867540983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34109-0_28     Document Type: Conference Paper
Times cited : (17)

References (24)
  • 1
    • 77956196952 scopus 로고    scopus 로고
    • Graph compression by BFS
    • Apostolico, A., Drovandi, G.: Graph compression by BFS. Algorithms 2(3), 1031-1044 (2009)
    • (2009) Algorithms , vol.2 , Issue.3 , pp. 1031-1044
    • Apostolico, A.1    Drovandi, G.2
  • 2
    • 84856239167 scopus 로고    scopus 로고
    • Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks
    • Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks. In: WWW, pp. 587-596 (2011)
    • (2011) WWW , pp. 587-596
    • Boldi, P.1    Rosa, M.2    Santini, M.3    Vigna, S.4
  • 3
    • 61649107228 scopus 로고    scopus 로고
    • Permuting web graphs
    • WAW 2009, Avrachenkov, K., Donato, D., Litvak, N. (Eds.) Springer, Heidelberg
    • Boldi, P., Santini, M., Vigna, S.: Permuting Web Graphs. In: Avrachenkov, K., Donato, D., Litvak, N. (eds.) WAW 2009. LNCS, vol. 5427, pp. 116-126. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5427 , pp. 116-126
    • Boldi, P.1    Santini, M.2    Vigna, S.3
  • 4
    • 33244456092 scopus 로고    scopus 로고
    • Rank/select operations on large alphabets: A tool for text indexing
    • Golynski, A., Munro, I., Srinivasa, S.: Rank/select operations on large alphabets: A tool for text indexing. In: SODA, pp. 368-373 (2006)
    • (2006) SODA , pp. 368-373
    • Golynski, A.1    Munro, I.2    Srinivasa, S.3
  • 5
    • 19944376183 scopus 로고    scopus 로고
    • The webgraph framework I: Compression techniques
    • Boldi, P., Vigna, S.: The webgraph framework I: compression techniques. In: WWW, pp. 595-602 (2004)
    • (2004) WWW , pp. 595-602
    • Boldi, P.1    Vigna, S.2
  • 6
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual Web search engine
    • Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Comp. Netw. 30(1-7), 107-117 (1998)
    • (1998) Comp. Netw. , vol.30 , Issue.1-7 , pp. 107-117
    • Brin, S.1    Page, L.2
  • 7
    • 70350633188 scopus 로고    scopus 로고
    • K2-trees for compact web graph representation
    • SPIRE 2009, Karlgren, J., Tarhio, J., Hyyrö, H. (Eds.) Springer, Heidelberg
    • Brisaboa, N.R., Ladra, S., Navarro, G.: K2-Trees for Compact Web Graph Representation. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 18-30. Springer, Heidelberg (2009)
    • (2009) LNCS , vol.5721 , pp. 18-30
    • Brisaboa, N.R.1    Ladra, S.2    Navarro, G.3
  • 8
    • 84974603470 scopus 로고    scopus 로고
    • Min-wise independent permutations: theory and practice
    • ICALP 2000, Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) Springer, Heidelberg
    • Broder, A.: Min-wise Independent Permutations: Theory and Practice. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 808. Springer, Heidelberg (2000)
    • (2000) LNCS , vol.1853 , pp. 808
    • Broder, A.1
  • 9
    • 42549139837 scopus 로고    scopus 로고
    • A scalable pattern mining approach to Web graph compression with communities
    • Buehrer, G., Chellapilla, K.: A scalable pattern mining approach to Web graph compression with communities. In: WSDM, pp. 95-106 (2008)
    • (2008) WSDM , pp. 95-106
    • Buehrer, G.1    Chellapilla, K.2
  • 12
    • 83055179446 scopus 로고    scopus 로고
    • Practical representations for web and social graphs
    • Claude, F., Ladra, S.: Practical representations for web and social graphs. In: CIKM, pp. 1185-1190 (2011)
    • (2011) CIKM , pp. 1185-1190
    • Claude, F.1    Ladra, S.2
  • 13
    • 77958035555 scopus 로고    scopus 로고
    • Fast and compact Web graph representations
    • art.16
    • Claude, F., Navarro, G.: Fast and compact Web graph representations. ACM TWEB 4(4), art.16 (2010)
    • (2010) ACM TWEB , vol.4 , Issue.4
    • Claude, F.1    Navarro, G.2
  • 14
    • 85041120916 scopus 로고    scopus 로고
    • Practical rank/select queries over arbitrary sequences
    • SPIRE 2008, Amir, A., Turpin, A., Moffat, A. (Eds.) Springer, Heidelberg
    • Claude, F., Navarro, G.: Practical Rank/Select Queries over Arbitrary Sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 176-187. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5280 , pp. 176-187
    • Claude, F.1    Navarro, G.2
  • 16
    • 0037739870 scopus 로고    scopus 로고
    • High-order entropy-compressed text indexes
    • Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA, pp. 841-850 (2003)
    • (2003) SODA , pp. 841-850
    • Grossi, R.1    Gupta, A.2    Vitter, J.S.3
  • 17
    • 84885473705 scopus 로고    scopus 로고
    • Compression of Web and social graphs supporting neighbor and community queries
    • Hernández, C., Navarro, G.: Compression of Web and social graphs supporting neighbor and community queries. In: SNA-KDD (2011)
    • (2011) SNA-KDD
    • Hernández, C.1    Navarro, G.2
  • 18
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. JACM 46(5), 604-632 (1999)
    • (1999) JACM , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.M.1
  • 20
    • 0032647886 scopus 로고    scopus 로고
    • Offline dictionary-based compression
    • Larsson, N.J., Moffat, A.: Offline dictionary-based compression. In: DCC, pp. 296-305 (1999)
    • (1999) DCC , pp. 296-305
    • Larsson, N.J.1    Moffat, A.2
  • 21
    • 77956212442 scopus 로고    scopus 로고
    • Neighbor query friendly compression of social networks
    • Maserrat, H., Pei, J.: Neighbor query friendly compression of social networks. In: KDD, pp. 533-542 (2010)
    • (2010) KDD , pp. 533-542
    • Maserrat, H.1    Pei, J.2
  • 23
    • 84968909171 scopus 로고    scopus 로고
    • Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
    • Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA, pp. 233-242 (2002)
    • (2002) SODA , pp. 233-242
    • Raman, R.1    Raman, V.2    Rao, S.S.3
  • 24
    • 84948402438 scopus 로고    scopus 로고
    • The link database: Fast access to graphs of the Web
    • Randall, K.H., Stata, R., Wiener, J.L., Wickremesinghe, R.: The link database: Fast access to graphs of the Web. In: DCC, pp. 122-131 (2002)
    • (2002) DCC , pp. 122-131
    • Randall, K.H.1    Stata, R.2    Wiener, J.L.3    Wickremesinghe, R.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.