In our contribution to the study of graph labelings with three distance constraints we introduce a concept of elegant labelings: labelings where labels appearing in a neighborhood of a vertex can be completed into intervals such that these intervals are disjoint for adjacent vertices. We justify introduction of this notion by showing that use of these labelings provides good estimates for the span of the label space, and also provide a polynomial time algorithm to find an optimal elegant labeling of a tree for distance constraints (p, 1, 1). In addition several computational complexity issues are discussed. © Springer-Verlag 2004.
CITATION STYLE
Fiala, J., Golovach, P. A., & Kratochvíl, J. (2004). Elegant distance constrained labelings of trees. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 58–67. https://doi.org/10.1007/978-3-540-30559-0_5
Mendeley helps you to discover research relevant for your work.