scientific article; zbMATH DE number 2079400

MaRDI QIDQ4471359zbMATH OpenFDO

Authors Stephen Alstrup, Philip Bille, Theis Rauhe

Publication date 28 July 2004

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Labeling Schemes for Small Distances in Trees
• Optimal distance labeling schemes for trees
• Distance labeling schemes for trees
• scientific article; zbMATH DE number 1830738
• Proximity-preserving labeling schemes

Cited in

(22)

• Labeling schemes for tree representation
• Localized and compact data-structure for comparability graphs
• Distance labeling scheme and split decomposition
• General compact labeling schemes for dynamic trees
• Average case analysis for tree labelling schemes
• On the succinct representation of equivalence classes
• Dynamic and multi-functional labeling schemes
• Distance Labeling for Permutation Graphs
• Short Labels for Lowest Common Ancestors in Trees
• scientific article; zbMATH DE number 1759444 (Why is no real title available?)
• Distance labeling schemes for trees
• scientific article; zbMATH DE number 1830738 (Why is no real title available?)
• scientific article; zbMATH DE number 1875437 (Why is no real title available?)
• scientific article; zbMATH DE number 1420896 (Why is no real title available?)
• Proximity-preserving labeling schemes
• Optimal distance labeling schemes for trees
• Distributed Relationship Schemes for Trees
• On local representation of distances in trees
• Labeling Schemes for Small Distances in Trees
• Distributed Computing – IWDC 2005
• Algorithms and Computation
• Constructing labeling schemes through universal matrices

This page was built for publication:

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