Algorithmic challenges in web search engines
Henzinger MH. 2004. Algorithmic challenges in web search engines. Internet Mathematics. 1(1), 115–123.
Download (ext.)
Journal Article
| Published
| English
Scopus indexed
Author
Abstract
In this paper, we describe six algorithmic problems that arise in web search engines and that are not or only partially solved: (1) Uniformly sampling of web pages; (2) modeling the web graph; (3) finding duplicate hosts; (4) finding top gainers and losers in data streams; (5) finding large dense bipartite graphs; and (6) understanding how eigenvectors partition the web.
Publishing Year
Date Published
2004-01-01
Journal Title
Internet Mathematics
Publisher
Internet Mathematics
Volume
1
Issue
1
Page
115-123
ISSN
eISSN
IST-REx-ID
Cite this
Henzinger MH. Algorithmic challenges in web search engines. Internet Mathematics. 2004;1(1):115-123. doi:10.1080/15427951.2004.10129079
Henzinger, M. H. (2004). Algorithmic challenges in web search engines. Internet Mathematics. Internet Mathematics. https://doi.org/10.1080/15427951.2004.10129079
Henzinger, Monika H. “Algorithmic Challenges in Web Search Engines.” Internet Mathematics. Internet Mathematics, 2004. https://doi.org/10.1080/15427951.2004.10129079.
M. H. Henzinger, “Algorithmic challenges in web search engines,” Internet Mathematics, vol. 1, no. 1. Internet Mathematics, pp. 115–123, 2004.
Henzinger MH. 2004. Algorithmic challenges in web search engines. Internet Mathematics. 1(1), 115–123.
Henzinger, Monika H. “Algorithmic Challenges in Web Search Engines.” Internet Mathematics, vol. 1, no. 1, Internet Mathematics, 2004, pp. 115–23, doi:10.1080/15427951.2004.10129079.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
Google Scholar