{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:04:24Z","timestamp":1725573864921},"publisher-location":"Berlin, Heidelberg","reference-count":9,"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_55","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T10:32:42Z","timestamp":1294396362000},"page":"606-617","source":"Crossref","is-referenced-by-count":1,"title":["A Web Page Scoring Method for Local Web Search Engines"],"prefix":"10.1007","author":[{"given":"Yohei","family":"Ikawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-40996-3_3","volume-title":"Algorithms and Computation","author":"P. Bose","year":"2000","unstructured":"Bose, P., Czyzowicz, J., G\u0105sieniec, L., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.: Strategies for Hotlink Assignment. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 23\u201334. Springer, Heidelberg (2000)"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Br\u00f6der, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph structure in the Web: Experiments and models. In: Proceedings of WWW, pp. 309\u2013320 (2000)","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"55_CR3","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Elementary Graph Algorithms. In: Introduction to Algorithms, 2nd edn., Ch. 22, pp. 527\u2013560 (2001)"},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., McCurley, K., Novak, J., Sivakumar, D., Tomlin, J., Williamson, D.: Seaching the Workplace Web. In: Proceedings of WWW (2003)","DOI":"10.1145\/775152.775204"},{"key":"55_CR5","unstructured":"Ikawa, Y., Sadakane, K.: A Webpage Scoring Method for Local Web Search Engines. FIT Information Technology Letters (in Japanese), LD-2 (2002)"},{"issue":"1","key":"55_CR6","first-page":"115","volume":"2","author":"Y. Ikawa","year":"2003","unstructured":"Ikawa, Y., Sadakane, K.: A Webpage Scoring Method for Local Web Search Engines. DBSJ Letters (in Japanese)\u00a02(1), 115\u2013118 (2003)","journal-title":"DBSJ Letters (in Japanese)"},{"key":"55_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48686-0_1","volume-title":"Computing and Combinatorics","author":"J. Kleinberg","year":"1999","unstructured":"Kleinberg, J., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: The Web as a graph: measurements, models, and methods. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 1\u201318. Springer, Heidelberg (1999)"},{"key":"55_CR8","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web. Technical Report, Computer Science Department, Stanford University (1998)"},{"key":"55_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/BFb0009492","volume-title":"Algorithms and Computation","author":"T. Uno","year":"1996","unstructured":"Uno, T.: An Algorithm for Enumerating All Directed Spanning Trees in a Directed Graph. In: Nagamochi, H., Suri, S., Igarashi, Y., Miyano, S., Asano, T. (eds.) ISAAC 1996. LNCS, vol.\u00a01178, pp. 166\u2013173. Springer, Heidelberg (1996)"}],"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_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T13:42:52Z","timestamp":1559914972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24571-1_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210474","9783540245711"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24571-1_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}