Average case analysis for tree labelling schemes

DOI10.1016/j.tcs.2007.02.066zbMath1120.68082OpenAlexW2090387507MaRDI QIDQ2371804

Weizhao Wang, Xiang-Yang Li, Ming-Yang Kao

Publication date: 9 July 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.066

zbMATH Keywords

average case analysisseparatortree labelling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nearest common ancestors: a survey and a new algorithm for a distributed environment
• The average height of binary trees and other simple trees
• Linear probing and graphs
• Efficient graph representations
• A few logs suffice to build (almost) all trees. II
• An unexpected result in coding the vertices of a graph
• The height of a random binary search tree
• A note on the height of binary search trees
• Implicat Representation of Graphs
• On the Complexity of Finite Sequences
• Tree Contractions and Evolutionary Trees
• Compact and localized distributed data structures
• Approximate distance oracles
• Coding the vertexes of a graph

This page was built for publication: Average case analysis for tree labelling schemes