Dynamic hotlinks
From MaRDI portal
Publication:2480907
DOI10.1007/S00453-007-9060-3zbMATH Open1141.68011OpenAlexW2913415918MaRDI QIDQ2480907FDOQ2480907
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- A data structure for dynamic trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved bounds for asymmetric communication protocols.
- Nearly optimal binary search trees
- Towards adaptive Web sites: Conceptual framework and case study
- Title not available (Why is that?)
- Asymmetric communication protocols via hotlink assignments
- Title not available (Why is that?)
- Algorithms and Computation
- Algorithms and Computation
- Approximate hotlink assignment
Cited In (5)
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)