{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:49:30Z","timestamp":1781077770894,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315930","type":"print"},{"value":"9783642315947","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_38","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"449-460","source":"Crossref","is-referenced-by-count":12,"title":["Streaming and Communication Complexity of Clique Approximation"],"prefix":"10.1007","author":[{"given":"Magn\u00fas M.","family":"Halld\u00f3rsson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoming","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-02930-1_27","volume-title":"Automata, Languages and Programming","author":"K.J. Ahn","year":"2009","unstructured":"Ahn, K.J., Guha, S.: Graph Sparsification in the Semi-streaming Model. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 328\u2013338. Springer, Heidelberg (2009)"},{"key":"38_CR2","unstructured":"Alon, N., Shapira, A.: A characterization of easily testable induced subgraphs. In: SODA 2004, pp. 942\u2013951. SIAM (2004)"},{"issue":"1","key":"38_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579196","volume":"7","author":"N. Alon","year":"1987","unstructured":"Alon, N., Boppana, R.B.: The monotone circuit complexity of boolean functions. Combinatorica\u00a07(1), 1\u201322 (1987)","journal-title":"Combinatorica"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory. In: FOCS 1986, pp. 337\u2013347. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.15"},{"key":"38_CR5","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: SODA 2002, pp. 623\u2013632 (2002)"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: KDD 2008, pp. 16\u201324 (2008)","DOI":"10.1145\/1401890.1401898"},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(76)90021-6","volume":"21","author":"B. Bollob\u00e1s","year":"1976","unstructured":"Bollob\u00e1s, B.: Complete subgraphs are elusive. Journal of Combinatorial Theory, Series B\u00a021(1), 1\u20137 (1976)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Bordino, I., Donato, D., Gionis, A., Leonardi, S.: Mining Large Networks with Subgraph Counting. In: 8th IEEE International Conference on Data Mining, pp. 737\u2013742. IEEE Computer Society (2008)","DOI":"10.1109\/ICDM.2008.109"},{"key":"38_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-540-75520-3_55","volume-title":"Algorithms \u2013 ESA 2007","author":"L.S. Buriol","year":"2007","unstructured":"Buriol, L.S., Frahling, G., Leonardi, S., Sohler, C.: Estimating Clustering Indexes in Data Streams. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 618\u2013632. Springer, Heidelberg (2007)"},{"issue":"1-2","key":"38_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. II. On completeness for W[1]. Theoretical Computer Science\u00a0141(1-2), 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P. Erd\u0151s","year":"1947","unstructured":"Erd\u0151s, P.: Some remarks on the theory of graphs. Bull. Amer. Math. Soc.\u00a053, 292\u2013294 (1947)","journal-title":"Bull. Amer. Math. Soc."},{"key":"38_CR12","first-page":"463","volume":"2","author":"P. Erd\u0151s","year":"1935","unstructured":"Erd\u0151s, P., Szekeres, G.: A combinatorial problem in geometry. Compositio. Math.\u00a02, 463\u2013470 (1935)","journal-title":"Compositio. Math.."},{"issue":"2","key":"38_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1137\/S089548010240415X","volume":"18","author":"U. Feige","year":"2004","unstructured":"Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Discrete Math.\u00a018(2), 219\u2013225 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"38_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theoretical Computer Science\u00a0348(2), 207\u2013216 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"38_CR15","doi-asserted-by":"publisher","first-page":"1709","DOI":"10.1137\/070683155","volume":"38","author":"J. Feigenbaum","year":"2008","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the data-stream model. SIAM J. Comput.\u00a038(5), 1709\u20131727 (2008)","journal-title":"SIAM J. Comput."},{"key":"38_CR16","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"G.R. Grimmett","year":"1975","unstructured":"Grimmett, G.R., McDiarmid, C.J.H.: On colouring random graphs. Mathematical Proceedings of the Cambridge Philosophical Society\u00a077, 313\u2013324 (1975)","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-642-14165-2_54","volume-title":"Automata, Languages and Programming","author":"B.V. Halld\u00f3rsson","year":"2010","unstructured":"Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Losievskaja, E., Szegedy, M.: Streaming Algorithms for Independent Sets. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 641\u2013652. Springer, Heidelberg (2010)"},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n\n                  1\u2009\u2212\u2009\u03b5\n                  . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Indyk, P., Price, E.: K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. In: STOC 2011, pp. 627\u2013636 (2011)","DOI":"10.1145\/1993636.1993720"},{"issue":"4","key":"38_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B. Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discrete Math.\u00a05(4), 545\u2013557 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11786986_21","volume-title":"Automata, Languages and Programming","author":"S. Khot","year":"2006","unstructured":"Khot, S., Ponnuswami, A.K.: Better Inapproximability Results for maxClique, Chromatic Number and Min-3Lin-Deletion. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 226\u2013237. Springer, Heidelberg (2006)"},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge Univ. Pr. (1997)","DOI":"10.1017\/CBO9780511574948"},{"key":"38_CR23","unstructured":"Losievskaja, E.: Approximation Algorithms for Independent Set Problems on Hypergraphs. PhD thesis. Reykjavik University (January 2010)"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-642-23719-5_57","volume-title":"Algorithms \u2013 ESA 2011","author":"M. Manjunath","year":"2011","unstructured":"Manjunath, M., Mehlhorn, K., Panagiotou, K., Sun, H.: Approximate Counting of Cycles in Streams. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 677\u2013688. Springer, Heidelberg (2011)"},{"key":"38_CR25","first-page":"939","volume":"18","author":"I. Ruzsa","year":"1976","unstructured":"Ruzsa, I., Szemer\u00e9di, E.: Triple systems with no six points carrying three triangles. Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai\u00a018, 939\u2013945 (1976)","journal-title":"Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai"},{"key":"38_CR26","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Some complexity questions related to distributive computing (preliminary report). In: STOC 1979, pp. 209\u2013213. ACM (1979)","DOI":"10.1145\/800135.804414"},{"issue":"3","key":"38_CR27","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ipl.2010.10.017","volume":"111","author":"M. Zelke","year":"2011","unstructured":"Zelke, M.: Intractability of min- and max-cut in streaming graphs. Inf. Process. Lett.\u00a0111(3), 145\u2013150 (2011)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:15:02Z","timestamp":1620130502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}