{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:48:40Z","timestamp":1725900520058},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540250565"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32392-9_30","type":"book-chapter","created":{"date-parts":[[2006,5,27]],"date-time":"2006-05-27T07:09:20Z","timestamp":1148713760000},"page":"289-296","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Quality of the RBS Ranking Algorithm"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Sydow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"R. Fagin, A. Karlin, J. Kleinberg, P. Raghavan, S. Rajagopalan, R. Rubinfeld, M. Sudan, and A. Tomkins. Random walks with back buttons. Annals of Applied Probability, 11(3), 2001.","DOI":"10.1214\/aoap\/1015345350"},{"issue":"1","key":"30_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R. Fagin","year":"2003","unstructured":"R. Fagin, R. Kumar, and D. Sivakumar. Comparing top k lists. SIAM J. Discrete Mathematics, 17(1):134\u2013160, 2003.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"F. Mathieu and M. Bouklit. The effect of the back button in a random walk (poster): Application for pagerank. In Proceedings of the 13th WWW Conference. Alternate Track. Papers and Posters. ACM Press, 2004.","DOI":"10.1145\/1013367.1013480"},{"key":"30_CR4","unstructured":"L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. In Stanford Digital Library Working Paper, 1998."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"G. Pandurangan, P. Raghavan, and E. Upfal. Using pagerank to characterize web structure. In Proceedings of the 8th Annual International Computing and Combinatorics Conference, 2002.","DOI":"10.1007\/3-540-45655-4_36"},{"key":"30_CR6","volume-title":"Link Analysis of the Web Graph. Measurements, Models and Algorithms for Web Information Retrieval","author":"M. Sydow","year":"2004","unstructured":"M. Sydow. Link Analysis of the Web Graph. Measurements, Models and Algorithms for Web Information Retrieval. PhD dissertation., Polish Academy of Sciences, Institute of Computer Science, Warsaw, 2004."},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"M. Sydow. Random surfer with back step (poster). In Proceedings of the 13th International WWW Conference, (Alternate Track. Papers and Posters), pages 352\u2013353. ACM press, 2004.","DOI":"10.1145\/1010432.1010536"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32392-9_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:53:46Z","timestamp":1619571226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32392-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540250565"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-32392-9_30","relation":{},"subject":[]}}