Dynamic hotlinks

DOI10.1007/S00453-007-9060-3MaRDI QIDQ2480907zbMATH OpenOpenAlexFDO

Authors Karim Douïeb, Stefan Langerman

Publication date 3 April 2008

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9060-3

zbMATH Keywords

AmortizationHotlink assignmentJumplist

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithms and Data Structures
• Approximate hotlink assignment
• Approximate hotlink assignment
• Near-Entropy Hotlink Assignments
• Near-entropy hotlink assignments

Cites work

• A data structure for dynamic trees
• Algorithms and Computation
• Approximate hotlink assignment
• Asymmetric communication protocols via hotlink assignments
• Efficient algorithms for the hotlink assignment problem: The worst case search
• scientific article; zbMATH DE number 437541 (Why is no real title available?)
• scientific article; zbMATH DE number 2226804 (Why is no real title available?)
• Improved bounds for asymmetric communication protocols.
• Nearly optimal binary search trees
• Randomized jumplists: A jump-and-walk dictionary data structure
• Strategies for hotlink assignments
• Towards adaptive Web sites: Conceptual framework and case study

Cited in

(6)

• On the complexity of optimal hotlink assignment
• Approximate hotlink assignment
• Algorithms and Computation
• Algorithms and Data Structures
• Near-Entropy Hotlink Assignments
• Near-entropy hotlink assignments

This page was built for publication: Dynamic hotlinks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480907)