A compact code for k-trees
Autor(a) principal: | |
---|---|
Data de Publicação: | 2009 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Pesquisa operacional (Online) |
Texto Completo: | http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000300001 |
Resumo: | 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). |
id |
SOBRAPO-1_60c84c04a444deaa3625a69e1b0993ac |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382009000300001 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
A compact code for k-treesk-treesPrüfer codecompact codeIn 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).Sociedade Brasileira de Pesquisa Operacional2009-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000300001Pesquisa Operacional v.29 n.3 2009reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382009000300001info:eu-repo/semantics/openAccessMarkenzon,LilianVernet,OswaldoPereira,Paulo Renato da Costaeng2010-02-03T00:00:00Zoai:scielo:S0101-74382009000300001Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2010-02-03T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
A compact code for k-trees |
title |
A compact code for k-trees |
spellingShingle |
A compact code for k-trees Markenzon,Lilian k-trees Prüfer code compact code |
title_short |
A compact code for k-trees |
title_full |
A compact code for k-trees |
title_fullStr |
A compact code for k-trees |
title_full_unstemmed |
A compact code for k-trees |
title_sort |
A compact code for k-trees |
author |
Markenzon,Lilian |
author_facet |
Markenzon,Lilian Vernet,Oswaldo Pereira,Paulo Renato da Costa |
author_role |
author |
author2 |
Vernet,Oswaldo Pereira,Paulo Renato da Costa |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Markenzon,Lilian Vernet,Oswaldo Pereira,Paulo Renato da Costa |
dc.subject.por.fl_str_mv |
k-trees Prüfer code compact code |
topic |
k-trees Prüfer code compact code |
description |
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). |
publishDate |
2009 |
dc.date.none.fl_str_mv |
2009-12-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000300001 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000300001 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0101-74382009000300001 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
text/html |
dc.publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
publisher.none.fl_str_mv |
Sociedade Brasileira de Pesquisa Operacional |
dc.source.none.fl_str_mv |
Pesquisa Operacional v.29 n.3 2009 reponame:Pesquisa operacional (Online) instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) instacron:SOBRAPO |
instname_str |
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
instacron_str |
SOBRAPO |
institution |
SOBRAPO |
reponame_str |
Pesquisa operacional (Online) |
collection |
Pesquisa operacional (Online) |
repository.name.fl_str_mv |
Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO) |
repository.mail.fl_str_mv |
||sobrapo@sobrapo.org.br |
_version_ |
1750318016991592448 |