{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:47:51Z","timestamp":1742395671458},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540210474"},{"type":"electronic","value":"9783540245711"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24571-1_34","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:32:42Z","timestamp":1294396362000},"page":"374-380","source":"Crossref","is-referenced-by-count":3,"title":["Web Page Grouping Based on Parameterized Connectivity"],"prefix":"10.1007","author":[{"given":"Tomonari","family":"Masada","sequence":"first","affiliation":[]},{"given":"Atsuhiro","family":"Takasu","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Adachi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"issue":"12","key":"34_CR2","first-page":"2152","volume":"E83-D","author":"T. Kanazawa","year":"2000","unstructured":"Kanazawa, T., Takasu, A., Adachi, J.: A relevance-based superimposition model for effective information retrieval. IEICE Trans. Inf. & Syst.\u00a0E83-D(12), 2152\u20132160 (2000)","journal-title":"IEICE Trans. Inf. & Syst."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Tajima, K., Mizuuchi, Y., Kitagawa, M., Tanaka, K.: Cut as a querying unit for WWW, Netnews, and E-mail. In: Proc. ACM Hypertext 1998, pp. 235\u2013244 (1998)","DOI":"10.1145\/276627.276653"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Dhillon, S.: Co-clustering documents and words using bipartite spectral graph partitioning, tech. rep. #TR 2001-05, Dept. of Computer Sciences, University of Texas at Austin (2001)","DOI":"10.1145\/502512.502550"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Kannan, R., Vempala, S., Vetta, A.: On clusterings - good, bad and spectral. In: Proc. 41st FOCS, pp. 367\u2013377 (2000)","DOI":"10.1109\/SFCS.2000.892125"},{"issue":"5","key":"34_CR6","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM\u00a046(5), 604\u2013632 (1999)","journal-title":"Journal of the ACM"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Borodin, A., Roberts, G.O., Rosenthal, J.S., Tsaparas, P.: Finding authorities and hubs from link structures on the world wide web. In: Proc. 10th WWW Conf., pp. 415\u2013429 (2001)","DOI":"10.1145\/371920.372096"},{"key":"34_CR8","unstructured":"Masada, T., Takasu, A., Adachi, J.: Decomposing the web graph into parameterized connected components. IEICE Trans. Special Issue on Information Processing Technology for Web Utilization\u00a0E87-D(2) (2004)"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Broder, Z., Kumar, S.R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the web. In: Proc. 9th WWW Conf., pp. 309\u2013320 (2000)","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"34_CR10","unstructured":"Cooper, C., Frieze, A.: The size of the largest strongly connected component of a random digraph with a given degree sequence, pre-print (2002), available at http:\/\/www.math.cmu.edu\/~af1p\/papers.html"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-44968-X_36","volume-title":"Computing and Combinatorics","author":"T. Takaoka","year":"2000","unstructured":"Takaoka, T.: Theory of trinomial heaps. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 362\u2013372. Springer, Heidelberg (2000)"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM J. Comput.\u00a01, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24571-1_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:42:13Z","timestamp":1559914933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}