Algorithms and Computation

DOI10.1007/11602613zbMATH Open1173.68452OpenAlexW2304246803MaRDI QIDQ5897847FDOQ5897847

Authors: Ming-Yang Kao, Weizhao Wang, Xiangyang Li 

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

Recommendations

• Average case analysis for tree labelling schemes
• Labeling Schemes for Small Distances in Trees
• Optimal distance labeling schemes for trees
• scientific article; zbMATH DE number 2079400
• Distance labeling schemes for trees

Mathematics Subject Classification ID

Trees (05C05) Data structures (68P05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (6)

• Proximity-preserving labeling schemes
• Labeling schemes for weighted dynamic trees
• Optimal distance labeling schemes for trees
• Average case analysis for tree labelling schemes
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Algorithms and Computation

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