메뉴 건너뛰기




Volumn 7611 LNCS, Issue , 2012, Pages 195-209

"Tri, tri again": Finding triangles and small subgraphs in a distributed setting

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION ROUNDS; DETERMINISTIC ALGORITHMS; HIGH PROBABILITY; MAXIMUM DEGREE; N-VERTEX GRAPH; NUMBER OF TRIANGLES; PROBABILISTIC ALGORITHM; ROUND COMPLEXITY; SPARSE GRAPHS; SUBGRAPHS;

EID: 84868368487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33651-5_14     Document Type: Conference Paper
Times cited : (115)

References (18)
  • 1
    • 0036437231 scopus 로고    scopus 로고
    • Testing subgraphs in large graphs
    • Alon, N.: Testing subgraphs in large graphs. Random Structures and Algorithms 21, 359-370 (2002)
    • (2002) Random Structures and Algorithms , vol.21 , pp. 359-370
    • Alon, N.1
  • 4
    • 0022011993 scopus 로고
    • Arboricity and subgraph listing algorithms
    • Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM Journal on Computing 14, 210-223 (1985)
    • (1985) SIAM Journal on Computing , vol.14 , pp. 210-223
    • Chiba, N.1    Nishizeki, T.2
  • 6
    • 84865022114 scopus 로고    scopus 로고
    • "Tri, Tri again".: Finding Triangles and Small Subgraphs in a Distributed Setting
    • abs/1201.6652
    • Dolev, D., Lenzen, C., Peled, S.: "Tri, Tri again".: Finding Triangles and Small Subgraphs in a Distributed Setting. Computing Research Repository abs/1201.6652 (2012)
    • (2012) Computing Research Repository
    • Dolev, D.1    Lenzen, C.2    Peled, S.3
  • 7
    • 82955197378 scopus 로고    scopus 로고
    • Counting Stars and Other Small Subgraphs in Sublinear-Time
    • Gonen, M., Ron, D., Shavitt, Y.: Counting Stars and Other Small Subgraphs in Sublinear-Time. SIAM Journal on Discrete Mathematics 25(3), 1365-1411 (2011)
    • (2011) SIAM Journal on Discrete Mathematics , vol.25 , Issue.3 , pp. 1365-1411
    • Gonen, M.1    Ron, D.2    Shavitt, Y.3
  • 8
    • 0000318572 scopus 로고
    • Zur Theorie der diskreten Gebilde, VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel
    • Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg
    • Grötzsch, H.: Zur Theorie der diskreten Gebilde, VII. Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. In: Math.-Nat. Reihe., vol. 8, pp. 109-120. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg (1958/1959)
    • (1958) Math.-Nat. Reihe. , vol.8 , pp. 109-120
    • Grötzsch, H.1
  • 9
    • 4444268694 scopus 로고    scopus 로고
    • Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
    • Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11), 1746-1758 (2004)
    • (2004) Bioinformatics , vol.20 , Issue.11 , pp. 1746-1758
    • Kashtan, N.1    Itzkovitz, S.2    Milo, R.3    Alon, U.4
  • 15
    • 0037174670 scopus 로고    scopus 로고
    • Network Motifs: Simple Building Blocks of Complex Networks
    • Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network Motifs: Simple Building Blocks of Complex Networks. Science 298(5594), 824-827 (2002), http://dx.doi.org/10.1126/science.298.5594.824
    • (2002) Science , vol.298 , Issue.5594 , pp. 824-827
    • Milo, R.1    Shen-Orr, S.2    Itzkovitz, S.3    Kashtan, N.4    Chklovskii, D.5    Alon, U.6
  • 16
    • 79959860533 scopus 로고    scopus 로고
    • The Round Complexity of Distributed Sorting: Extended Abstract
    • Patt-Shamir, B., Teplitsky, M.: The Round Complexity of Distributed Sorting: Extended Abstract. In: PODC, pp. 249-256 (2011)
    • (2011) PODC , pp. 249-256
    • Patt-Shamir, B.1    Teplitsky, M.2


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