메뉴 건너뛰기




Volumn , Issue , 2008, Pages 563-568

Graph sparsification by effective resistances

Author keywords

Electrical flows; Random sampling; Spectral graph theory

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; GRAPHIC METHODS;

EID: 57049148610     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374456     Document Type: Conference Paper
Times cited : (219)

References (24)
  • 1
    • 0034819702 scopus 로고    scopus 로고
    • Database-friendly random projections
    • D. Achlioptas. Database-friendly random projections. In PODS '01, pages 274-281, 2001.
    • (2001) PODS '01 , pp. 274-281
    • Achlioptas, D.1
  • 2
    • 0034830284 scopus 로고    scopus 로고
    • Fast computation of low rank matrix approximations
    • D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations. In STOC '01, pages 611-618, 2001.
    • (2001) STOC '01 , pp. 611-618
    • Achlioptas, D.1    McSherry, F.2
  • 6
    • 0024864589 scopus 로고
    • The electrical resistance of a graph captures its commute and cover times
    • A. K. Chandra, P. Raghavan, W. L. Ruzzo, and R. Smolensky. The electrical resistance of a graph captures its commute and cover times. In STOC '89, pages 574-586, 1989.
    • (1989) STOC '89 , pp. 574-586
    • Chandra, A.K.1    Raghavan, P.2    Ruzzo, W.L.3    Smolensky, R.4
  • 9
    • 0035186125 scopus 로고    scopus 로고
    • Fast monte-carlo algorithms for approximate matrix multiplication
    • P. Drineas and R. Kannan. Fast monte-carlo algorithms for approximate matrix multiplication. In FOCS '01, pages 452-459, 2001.
    • (2001) FOCS '01 , pp. 452-459
    • Drineas, P.1    Kannan, R.2
  • 10
    • 0038416092 scopus 로고    scopus 로고
    • Pass efficient algorithms for approximating large matrices
    • P. Drineas and R. Kannan. Pass efficient algorithms for approximating large matrices. In SODA '03, pages 223-232, 2003.
    • (2003) SODA '03 , pp. 223-232
    • Drineas, P.1    Kannan, R.2
  • 11
  • 12
    • 33847766633 scopus 로고    scopus 로고
    • Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation
    • F. Fouss, A. Pirotte, J.-M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. Knowledge and Data Engineering, IEEE Transactions on, 19(3):355-369, 2007.
    • (2007) Knowledge and Data Engineering, IEEE Transactions on , vol.19 , Issue.3 , pp. 355-369
    • Fouss, F.1    Pirotte, A.2    Renders, J.-M.3    Saerens, M.4
  • 13
    • 20444476106 scopus 로고    scopus 로고
    • Fast monte-carlo algorithms for finding low-rank approximations
    • A. Frieze, R. Kannan, and S. Vempala. Fast monte-carlo algorithms for finding low-rank approximations. J. ACM, 51(6):1025-1041, 2004.
    • (2004) J. ACM , vol.51 , Issue.6 , pp. 1025-1041
    • Frieze, A.1    Kannan, R.2    Vempala, S.3
  • 15
    • 0002471366 scopus 로고
    • A new approach to the maximum flow problem
    • A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. In STOC '86, pages 136-146, 1986.
    • (1986) STOC '86 , pp. 136-146
    • Goldberg, A.V.1    Tarjan, R.E.2
  • 16
    • 0034342157 scopus 로고    scopus 로고
    • Graph embeddings and laplacian eigenvalues
    • S. Guattery and G. L. Miller. Graph embeddings and laplacian eigenvalues. SIAM J. Matrix Anal. Appl., 21(3):703-723, 2000.
    • (2000) SIAM J. Matrix Anal. Appl , vol.21 , Issue.3 , pp. 703-723
    • Guattery, S.1    Miller, G.L.2
  • 17
    • 0001654702 scopus 로고
    • Extensions of lipschitz mappings into a hilbert space
    • W. Johnson and J. Lindenstrauss. Extensions of lipschitz mappings into a hilbert space. Contemp. Math., 26:189-206, 1984.
    • (1984) Contemp. Math , vol.26 , pp. 189-206
    • Johnson, W.1    Lindenstrauss, J.2
  • 18
    • 57049103692 scopus 로고    scopus 로고
    • J. Kelner. Lecture notes for 18.409, an algorithmist's toolkit. 2007.
    • J. Kelner. Lecture notes for 18.409, an algorithmist's toolkit. 2007.
  • 19
    • 33748110067 scopus 로고    scopus 로고
    • Graph partitioning using single commodity flows
    • R. Khandekar, S. Rao, and U. Vazirani. Graph partitioning using single commodity flows. In STOC '06, pages 385-390, 2006.
    • (2006) STOC '06 , pp. 385-390
    • Khandekar, R.1    Rao, S.2    Vazirani, U.3
  • 21
    • 0033541884 scopus 로고    scopus 로고
    • Random vectors in the isotropic position
    • M. Rudelson. Random vectors in the isotropic position. J. of Functional Analysis, 163(1):60-72, 1999.
    • (1999) J. of Functional Analysis , vol.163 , Issue.1 , pp. 60-72
    • Rudelson, M.1
  • 22
    • 34547728320 scopus 로고    scopus 로고
    • Sampling from large matrices: An approach through geometric functional analysis
    • M. Rudelson and R. Vershynin. Sampling from large matrices: An approach through geometric functional analysis. J. ACM, 54(4):21, 2007.
    • (2007) J. ACM , vol.54 , Issue.4 , pp. 21
    • Rudelson, M.1    Vershynin, R.2
  • 23
    • 4544280485 scopus 로고    scopus 로고
    • Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
    • Full version available at
    • D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC '04, pages 81-90, 2004. Full version available at http://arxiv.org/abs/cs. DS/0310051.
    • (2004) STOC '04 , pp. 81-90
    • Spielman, D.A.1    Teng, S.-H.2


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