SearchSkip to Search Results
- 2Dynamic implicit informative labelling scheme
- 2Implicit representation
- 1$k$-polygon graph
- 1Bandwidth Minimization
Technical report TR05-03. This work is an introductory study of dynamic implicit informative labelling schemes, a topic suggested by Kannan et al. (Kannan et al., SIAM J Disc Mat, 1992) but not explored in their work. In particular, we define what is meant by a dynamic implicit informative...
Technical report TR05-01. Given a tree T consider one of its longest paths P_T. We define T to be m-distant if all of its vertices are a distance at most m from P_T. We will show that any 3-distant tree satisfying both of the following properties is graceful. The tree has a perfect matching....
Technical report TR05-02. Assmann et al. [SIAM J. Alg. Disc. Meth., 2 (1981), 387-393] have shown that the bandwidth of caterpillars on n vertices with hairs of length at most two can be found in O(n log n) time and Monien [SIAM J. Alg. Disc. Meth., 7 (1986), 505-512] has shown that Bandwidth...
Technical report TR05-04. As defined by Peleg (Peleg, LNCS vol. 1893, 2000), an informative labelling scheme labels the vertices of a graph so that information can be deduced from the vertex labels. Peleg's paper on informative labelling schemes generalized the concepts introduced by Muller...