Name
Abstract | ||
|---|---|---|
An unordered tree inclusion is the problem of determining whether or not an unordered tree P is included in an unordered tree T. In this paper, we introduce an isolated-sub tree inclusion by restricting that disjoint sub trees of P are always included in disjoint sub trees of T. Then, we design the algorithm to solve the isolated-sub tree inclusion in O(|T| |P|^{1.5}) time and in O(|T| |P|) space. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/IIAI-AAI.2012.74 | IIAI-AAI |
Keywords | Field | DocType |
isolated-subtree inclusion,isolated-sub tree inclusion,unordered trees,unordered tree,disjoint sub tree,unordered tree inclusion,computational complexity,informatics | Combinatorics,Disjoint sets,Tree (data structure),Algorithm,Mathematics,Computational complexity theory | Conference |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takahiro Hokazono | 1 | 0 | 0.34 |
| Tomohiro Kan | 2 | 4 | 1.10 |
| Yoshiyuki Yamamoto | 3 | 3 | 1.09 |
| Kouichi Hirata | 4 | 130 | 32.04 |