Assigning bookmarks in perfect binary trees.

MaRDI QIDQ5310248zbMATH OpenFDO

Authors Jurek Czyzowicz, Andrzej Pelc, Miguel Vargas Martin, Evangelos Kranakis, D. Krizanc

Publication date 21 September 2007

zbMATH Keywords

bookmarksdistancerooted complete binary tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Recommendations

• Extremal properties of ?-weighted binary trees
• scientific article; zbMATH DE number 4047157
• Optimal binary trees with order constraints
• scientific article; zbMATH DE number 1123792
• Average case analysis for tree labelling schemes

Cited in

(1)

• Optimal approximability of bookmark assignments

This page was built for publication: Assigning bookmarks in perfect binary trees.

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