Loading...
Please wait, while we are loading the content...
A Refinement for Ordered Labeled Trees
| Content Provider | Semantic Scholar |
|---|---|
| Author | Seo, Seunghyun Shin, Heesung |
| Copyright Year | 2012 |
| Abstract | Let O_ n be the set of ordered labeled trees on { 0 , . . . , n } . A maximal decreasing subtree of an ordered labeled tree is defined by the maximal ordered subtree from the root with all edges being decreasing. In this paper, we study a new refinement O_{ n,k} of O_ n , which is the set of ordered labeled trees whose maximal decreasing subtree has k + 1 vertices. |
| Starting Page | 255 |
| Ending Page | 261 |
| Page Count | 7 |
| File Format | PDF HTM / HTML |
| DOI | 10.11568/kjm.2012.20.2.255 |
| Volume Number | 20 |
| Alternate Webpage(s) | http://ocean.kisti.re.kr/downfile/volume/kkms/E1KKMK/2012/v20n2/E1KKMK_2012_v20n2_255.pdf |
| Alternate Webpage(s) | https://arxiv.org/pdf/1207.3291v1.pdf |
| Alternate Webpage(s) | https://doi.org/10.11568/kjm.2012.20.2.255 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |