Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419831 | Discrete Applied Mathematics | 2008 | 7 Pages |
Abstract
We present in this paper a codeword for labelled kk-path graphs. Structural properties of this codeword are investigated, leading to the solution of two important problems: determining the exact number of labelled kk-path graphs with nn vertices and locating a hamiltonian path in a given kk-path graph in time O(n)O(n). The corresponding encoding scheme is also presented, providing linear-time algorithms for encoding and decoding.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
P.R.C. Pereira, L. Markenzon, O. Vernet,