Komoto, K., Kurita, K., & Ono, H. (2026). The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees.
Chicago Style (17th ed.) CitationKomoto, Kenta, Kazuhiro Kurita, and Hirotaka Ono. The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees. 2026.
MLA (9th ed.) CitationKomoto, Kenta, et al. The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees. 2026.
Warning: These citations may not always be 100% accurate.