Sciweavers

ESA
2006
Springer
105views Algorithms» more  ESA 2006»
13 years 8 months ago
Near-Entropy Hotlink Assignments
Consider a rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by ...
Karim Douïeb, Stefan Langerman