{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:15Z","timestamp":1763468115451,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336508"},{"type":"electronic","value":"9783642336515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33651-5_14","type":"book-chapter","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T09:25:32Z","timestamp":1352798732000},"page":"195-209","source":"Crossref","is-referenced-by-count":58,"title":["\u201cTri, Tri Again\u201d: Finding Triangles and Small Subgraphs in a Distributed Setting"],"prefix":"10.1007","author":[{"given":"Danny","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Lenzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shir","family":"Peled","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.10056","volume":"21","author":"N. Alon","year":"2002","unstructured":"Alon, N.: Testing subgraphs in large graphs. Random Structures and Algorithms\u00a021, 359\u2013370 (2002)","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1137\/07067917X","volume":"22","author":"N. Alon","year":"2008","unstructured":"Alon, N., Kaufman, T., Krivelevich, M., Ron, D.: Testing triangle-freeness in general graphs. SIAM Journal on Discrete Math.\u00a022(2), 786\u2013819 (2008)","journal-title":"SIAM Journal on Discrete Math."},{"key":"14_CR3","unstructured":"Chechik, S.: Message distribution technique (2011), private communication"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM Journal on Computing\u00a014, 210\u2013223 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR5","unstructured":"Deo, N., Litow, B.: A Structural Approach to Graph Compression. In: Proc. 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 91\u2013101 (1998)"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Dolev, D., Lenzen, C., Peled, S.: \u201dTri, Tri again\u201d.: Finding Triangles and Small Subgraphs in a Distributed Setting. Computing Research Repository abs\/1201.6652 (2012)","DOI":"10.1007\/978-3-642-33651-5_14"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1137\/100783066","volume":"25","author":"M. Gonen","year":"2011","unstructured":"Gonen, M., Ron, D., Shavitt, Y.: Counting Stars and Other Small Subgraphs in Sublinear-Time. SIAM Journal on Discrete Mathematics\u00a025(3), 1365\u20131411 (2011)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR8","unstructured":"Gr\u00f6tzsch, H.: Zur Theorie der diskreten Gebilde, VII. Ein Dreifarbensatz f\u00fcr dreikreisfreie Netze auf der Kugel. In: Math.-Nat. Reihe., vol.\u00a08, pp. 109\u2013120. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg (1958\/1959)"},{"issue":"11","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N. Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics\u00a020(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"key":"14_CR10","unstructured":"Kothapalli, K., Scheideler, C., Onus, M., Schindelhauer, C.: Distributed Coloring in $\\tilde{\\mathcal{O}}(\\sqrt{\\log n})$ Bit Rounds. In: IPDPS (2006)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Wattenhofer, R.: Tight Bounds for Parallel Randomized Load Balancing. In: Proc. 43rd Symposium on Theory of Computing (STOC), pp. 11\u201320 (2011)","DOI":"10.1145\/1993636.1993639"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Lotker, Z., Patt-Shamir, B., Peleg, D.: Distributed MST for Constant Diameter Graphs. Distributed Computing\u00a018(6) (2006)","DOI":"10.1007\/s00446-005-0127-6"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Lotker, Z., Pavlov, E., Patt-Shamir, B., Peleg, D.: MST Construction in $\\mathcal{O}(log log n)$ Communication Rounds. In: Proc. 15th Symposium on Parallel Algorithms and Architectures (SPAA), pp. 94\u2013100 (2003)","DOI":"10.1145\/777426.777428"},{"key":"14_CR14","unstructured":"McKay (mathoverflow.net\/users\/9025), B.: If many triangles share edges, then some edge is shared by many triangles. MathOverflow, http:\/\/mathoverflow.net\/questions\/83939 (version: 2011-12-20)"},{"issue":"5594","key":"14_CR15","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R. Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network Motifs: Simple Building Blocks of Complex Networks. Science\u00a0298(5594), 824\u2013827 (2002), http:\/\/dx.doi.org\/10.1126\/science.298.5594.824","journal-title":"Science"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Patt-Shamir, B., Teplitsky, M.: The Round Complexity of Distributed Sorting: Extended Abstract. In: PODC, pp. 249\u2013256 (2011)","DOI":"10.1145\/1993806.1993851"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed Verification and Hardness of Distributed Approximation. In: 43rd Symposium on Theory of Computing, STOC (2011)","DOI":"10.1137\/11085178X"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33651-5_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T09:39:37Z","timestamp":1714556377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33651-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336508","9783642336515"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33651-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}