2010
DOI: 10.1007/978-3-642-11440-3_16
| View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. A bijective code is a method for associating labeled n-trees to (n − 2)-strings of node labels in such a way that different trees yield different strings and vice versa. For all known bijective codes, optimal sequential encoding and decoding algorithms are presented in literature, while parallel algorithms are investigated only for some of these codes. In this paper we focus our attention on the Blob code: a code particularly considered in the field of Genetic Algorithms. To the best of our knowledge… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2010
2010
2010
2010

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 19 publications
0
2
0
Order By: Relevance
“…For the decoding phase, only nonoptimal algorithms are known [5]. Recently, parallel algorithms for Blob code have been presented [8]: the encoding algorithm is optimal, while the decoding algorithm requires O(n log n) cost (number of processors multiplied by the maximum time required by a single processor) and concurrent read.…”
Section: Algorithmic Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…For the decoding phase, only nonoptimal algorithms are known [5]. Recently, parallel algorithms for Blob code have been presented [8]: the encoding algorithm is optimal, while the decoding algorithm requires O(n log n) cost (number of processors multiplied by the maximum time required by a single processor) and concurrent read.…”
Section: Algorithmic Resultsmentioning
confidence: 99%
“…Max Down Preserve C 4 Max Up Invert C 5 Min Up Preserve C 6 Min Down Invert C 7 Min Down Preserve C 8 Min Up Invert 1. use minimum instead of maximum to compute flying nodes among those nodes in the path 1 ; 0;…”
Section: Codementioning
confidence: 99%