Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
- 2Dynamic implicit informative labelling scheme
- 2Implicit representation
- 2Lobster
- 1$k$-polygon graph
- 1$r$-mino
- 1Bandwidth Minimization
Year
Collections
Languages
Departments
-
2005
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...
-
Useful names for vertices: An introduction to dynamic implicit informative labelling schemes
Download2005
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...
1 - 5 of 5