Searching for "On coding labeled trees." – sorted by Relevance.
-
A Unified Approach to Coding Labeled Trees
- A unified approach to coding labeled trees Saverio Caminiti 1 , Irene Finocchi 2 , and Rossella
- Add To MetaCart
-
Prüfer-like codes for labeled trees
- Prüfer-Like Codes for Labeled Trees Narsingh Deo and Paulius Micikevicius School of Electrical
- Cited by 9 (1 self) – Add To MetaCart
-
Parallel algorithms for computing Prüfer-like codes of labeled trees
- Parallel Algorithms for Computing Prüfer-Like Codes for Labeled Trees Narsingh Deo School
- Cited by 4 (1 self) – Add To MetaCart
-
Colored Prufer codes for k-edge colored trees
- combinatorial bijection between k-edge colored trees and colored Prüfer codes for labelled trees is established
- Add To MetaCart
-
Colored Pr"ufer codes for k-edge colored trees Manwon Cho, Dongsu Kim\Lambda y, Seunghyun Seo
- combinatorial bijection between k-edge colored trees and colored Pr"ufer codes for labelled trees is established
- Add To MetaCart
-
A new encoding for labeled trees employing a stack and a queue
- , such as the number of leaves, maximum degree, or diameter of the tree [1, 9]. Existing codes for labeled trees Prüfer
- Cited by 10 (3 self) – Add To MetaCart
-
Formal Verification of a Compiler Back-end
- any case where the code that will further be generated from the labeled tree will not exactly
- Add To MetaCart
-
Neural Network Synthesis Using Cellular Encoding And The Genetic Algorithm.
- problems. We used the same technic of coding into labeled trees. We will see in the conclusion
- Cited by 123 (5 self) – Add To MetaCart
-
Finding composition trees for multiple-valued functions
- of bound sets may be exponential, as in (b), but they are efficiently coded by this labeled tree, which has
- Cited by 3 (1 self) – Add To MetaCart
-
Finding Composition Trees for Multiple-Valued Functions
- may be exponential, as in (b), but they are efficiently coded by this labeled tree, which has size
- Add To MetaCart

