A clique-difference encoding scheme for labelled k-path graphs

Authors:
P. R. C. Pereira;L. Markenzon;O. Vernet
Affiliations:
Instituto Militar de Engenharia, Praça General Tibúrcio, 80, 22290-270, Rio de Janeiro, Brazil;Núcleo de Computação Eletrônica, Universidade Federal do Rio de Janeiro, CP 2324, 20010-974, Rio de Janeiro, Brazil;Núcleo de Computação Eletrônica, Universidade Federal do Rio de Janeiro, CP 2324, 20010-974, Rio de Janeiro, Brazil
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 3
Cited 1

A coding algorithm for Re´nyi trees

Journal of Combinatorial Theory Series A
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science
Subclasses of k-trees: characterization and recognition

Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization

Generating and counting unlabeled k-path graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present in this paper a codeword for labelled k-path graphs. Structural properties of this codeword are investigated, leading to the solution of two important problems: determining the exact number of labelled k-path graphs with n vertices and locating a hamiltonian path in a given k-path graph in time O(n). The corresponding encoding scheme is also presented, providing linear-time algorithms for encoding and decoding.