A compact code for k-trees

Author:

Markenzon Lilian1,Vernet Oswaldo1,Pereira Paulo Renato da Costa2

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).

Publisher

FapUNIFESP (SciELO)

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3