Abstract
Consider a DAG (directed acyclic graph) G = (V,E) representing a collection V of web pages connected via links E. All web pages can be reached from a designated source page, represented by a source node s of G. Each web page carries a weight representative of the frequency with which it is visited. By adding hotlinks, at most one per page, we are interested in minimizing the expected number of steps needed to visit a selected set of web pages from the source page. For arbitrary DAGs we show that the problem is NP-complete.
We also give algorithms for assigning hotlinks, as well as upper and lower bounds on the expected number of steps to reach the leaves from the source page s located at the root of a complete binary tree. Depending on the probability distribution (arbitrary, uniform, Zipf) the expected number of steps is at most c . n, where c is a constant less than 1. For the geometric distribution we show how to obtain a constant average number of steps.
Research supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) grants, by MITACS (Mathematics of Information Technology and Complex Systems) and a CONACYT fellowship from the Mexican government.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Abramson, “Information Theory and Coding”, McGraw Hill, 1963.
W. Aiello, F. Chung, L. Lu, “A random graph model for massive graphs”. To appear in Proc. of the 32nd ACM Symp. on the Theory of Computing, 2000.
J. Czyzowicz, E. Kranakis, A. Pelc, M. Vargas Martin, “Optimal Assignment of Bookmarks to Web Pages”, to appear.
M. Faloutsos, P. Faloutsos, C. Faloutsos, “On Power-Law Relationships of the Internet Topology”, In proceedings of SIGCOM: IEEE Conference on Communication, 1999.
M.R. Garey and D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman and Co., New York, 1979.
J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, A. S. Tomkins, “The Web as a graph: measurements, models, and methods. In Proc. of the Fifth Int. Conf. on Computing and Combinatorics”, Springer-Verlag, pages 1–17, 1999.
D. Knuth, “The Art of Computer Programming: Volume 1, Fundamental Algorithms”, Addison Wesley, 2nd ed., 1997.
D. Knuth, “The Art of Computer Programming: Volume 3, Sorting and Searching”, Addison Wesley, 3rd ed., 1998.
B. Li, M. Golin, G. Italiano, X. Deng and K. Sohraby, “On the Optimal Placement of Web Proxies in the Internet”, IEEE InfoCom’99, pp.1282–1290, 1999.
B. Li, X. Deng, M. Golin, and K. Sohraby, “On the Optimal Placement of Web Proxies in the Internet”, 8th IFIP Conf. on High Performance Networking, 1998.
C. K. Zipf. “Human Behavior and the Principle of Least Effort”, Reading Mass., Addison Wesley, 1949.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bose, P. et al. (2000). Strategies for Hotlink Assignments. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-40996-3_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41255-7
Online ISBN: 978-3-540-40996-0
eBook Packages: Springer Book Archive