乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:41:33Z","timestamp":1725579693050},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642197536"},{"type":"electronic","value":"9783642197543"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19754-3_20","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T09:22:38Z","timestamp":1301304158000},"page":"193-205","source":"Crossref","is-referenced-by-count":6,"title":["Computing Strongly Connected Components in the Streaming Model"],"prefix":"10.1007","author":[{"given":"Luigi","family":"Laura","sequence":"first","affiliation":[]},{"given":"Federico","family":"Santaroni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00453-001-0088-5","volume":"32","author":"J. Abello","year":"2002","unstructured":"Abello, J., Buchsbaum, A., Westbrook, J.: A functional approach to external graph algorithms. Algorithmica\u00a032(3), 437\u2013458 (2002)","journal-title":"Algorithmica"},{"key":"20_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-75520-3_54","volume-title":"Algorithms \u2013 ESA 2007","author":"G. Ausiello","year":"2007","unstructured":"Ausiello, G., Demetrescu, C., Franciosa, P., Italiano, G., Ribichini, A.: Small stretch spanners in the streaming model: New algorithms and experiments. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 605\u2013617. Springer, Heidelberg (2007)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Firmani, D., Laura, L.: Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components. Networks (to appear, 2011)","DOI":"10.1002\/net.21450"},{"key":"20_CR5","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2002)"},{"issue":"8","key":"20_CR6","first-page":"711","volume":"34","author":"P. Boldi","year":"2004","unstructured":"Boldi, P., Codenotti, B., Santini, M., Vigna, S.: Ubicrawler: A scalable fully distributed web crawler. Software: Practice & Experience\u00a034(8), 711\u2013726 (2004)","journal-title":"Software: Practice & Experience"},{"issue":"1-6","key":"20_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S1389-1286(00)00083-9","volume":"33","author":"A.Z. Broder","year":"2000","unstructured":"Broder, A.Z., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.L.: Graph structure in the web. Computer Networks\u00a033(1-6), 309\u2013320 (2000)","journal-title":"Computer Networks"},{"issue":"6","key":"20_CR8","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BF01940880","volume":"15","author":"J. Cheriyan","year":"1996","unstructured":"Cheriyan, J., Mehlhorn, K.: Algorithms for dense graphs and networks on the random access computer. Algorithmica\u00a015(6), 521\u2013549 (1996)","journal-title":"Algorithmica"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1149121.1149124","volume":"6","author":"J. Cho","year":"2006","unstructured":"Cho, J., Garcia-Molina, H., Haveliwala, T., Lam, W., Paepcke, A., Raghavan, S., Wesley, G.: Stanford webbase components and applications. ACM Trans. Inter. Tech.\u00a06(2), 153\u2013186 (2006)","journal-title":"ACM Trans. Inter. Tech."},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Cosgaya-Lozano, A., Zeh, N.: A faster heuristic for strong connectivity of massive graphs. In: Proceedings of the 8th International Symposium on Experimental Algorithms, SEA (2009)","DOI":"10.1007\/978-3-642-02011-7_12"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-74456-6_19","volume-title":"Mathematical Foundations of Computer Science 2007","author":"C. Demetrescu","year":"2007","unstructured":"Demetrescu, C., Escoffier, B., Moruz, G., Ribichini, A.: Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 194\u2013205. Springer, Heidelberg (2007)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Finocchi, R., Ribichini, A.: Trading off space for passes in graph streaming problems. In: Proc. of SODA 2006, pp. 714\u2013723 (2006)","DOI":"10.1145\/1109557.1109635"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Donato, D., Laura, L., Leonardi, S., Millozzi, S.: The web as a graph: How far we are. ACM Trans. Internet Techn.\u00a07(1) (2007)","DOI":"10.1145\/1189740.1189744"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/978-3-540-73420-8_62","volume-title":"Automata, Languages and Programming","author":"M. Elkin","year":"2007","unstructured":"Elkin, M.: Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 716\u2013727. Springer, Heidelberg (2007)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-540-27836-8_46","volume-title":"Automata, Languages and Programming","author":"J. Feigenbaum","year":"2004","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 531\u2013543. Springer, Heidelberg (2004)"},{"key":"20_CR16","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the streaming model: the value of space. In: Proceedings of the 16th ACM\/SIAM Symposium on Discrete Algorithms (SODA), pp. 745\u2013754 (2005)"},{"issue":"3","key":"20_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/116873.116878","volume":"23","author":"Z. Galil","year":"1991","unstructured":"Galil, Z., Italiano, G.: Data structures and algorithms for disjoint set union problems. ACM Comput. Surv.\u00a023(3), 319\u2013344 (1991)","journal-title":"ACM Comput. Surv."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External Memory algorithms. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a050, pp. 107\u2013118 (1999)","DOI":"10.1090\/dimacs\/050\/05"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/11538462_15","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. McGregor","year":"2005","unstructured":"McGregor, A.: Finding graph matchings in data streams. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 170\u2013181. Springer, Heidelberg (2005)"},{"key":"20_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"I. Munro","year":"1980","unstructured":"Munro, I., Paterson, M.: Selection and sorting with limited storage. Theoretical Computer Science\u00a012, 315\u2013323 (1980)","journal-title":"Theoretical Computer Science"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, S.: Data streams: Algorithms and applications. Foundations and Trends in Theoretical Computer Science 1(2) (2005)","DOI":"10.1561\/0400000002"},{"key":"20_CR22","unstructured":"Ribichini, A.: Streaming Algorithms for Graph Problems. PhD thesis, Sapienza University of Rome, Italy (2007)"},{"key":"20_CR23","unstructured":"Ruhl, J.: Efficient Algorithms for New Computational Models. PhD thesis, Massauchussets Institute of Technology (September 2003)"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Sibeyn, J., Abello, J., Meyer, U.: Heuristics for semi-external depth first search on directed graphs. In: Proceedings of SPAA 2002 (2002)","DOI":"10.1145\/564870.564917"},{"issue":"2","key":"20_CR25","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"J. Vitter","year":"2001","unstructured":"Vitter, J.: External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys\u00a033(2), 209\u2013271 (2001)","journal-title":"ACM Computing Surveys"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Vitter, J.: Algorithms and data structures for external memory. Foundations and Trends in Theoretical Computer Science\u00a02(4) (2006)","DOI":"10.1561\/0400000014"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Algorithms in (Computer) Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19754-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T12:21:43Z","timestamp":1558527703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19754-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642197536","9783642197543"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19754-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}