Affiliation:
1. Universidade Federal do Rio de Janeiro, Brazil
2. Instituto Militar de Engenharia, Brazil
Abstract
In this paper, we propose a new representation for k-trees - the compact code, which reduces the required memory space from O(nk) to O(n). The encoding and decoding algorithms, based on a simplification of a priority queue, are linear and very simple. As long as the k-tree is represented by its compact code, the exact vertex coloring problem can be solved in time O(n).
Subject
Management Science and Operations Research
Reference17 articles.
1. An Introduction to Chordal Graphs and Clique Trees;Blair J.R.S.;Graph Theory and Sparse Matrix Computation,1993
2. A Coding Algorithm for Rényi Trees;Chen W.Y.C.;Journal of Combinatorial Theory,1993
3. Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph;Chandran L.S.;Theoretical Computer Science,2003
4. On the Spanning k-Tree Problem;Cai L.;Discrete Applied Mathematics,1993
5. A Bijective Code for k-Trees with Linear Time Encoding and Decoding;Caminiti S.;LNCS,2007
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Counting and enumerating unlabeled split–indifference graphs;Discrete Mathematics, Algorithms and Applications;2017-08