The paper shows that small height bounds on rooted trees do not generally yield efficient enumeration for closed or maximal frequent trees, except for a polynomial-delay algorithm in the unordered closed case of height at most 2, while linking other cases to Dualization or NP-hardness.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
The paper shows that small height bounds on rooted trees do not generally yield efficient enumeration for closed or maximal frequent trees, except for a polynomial-delay algorithm in the unordered closed case of height at most 2, while linking other cases to Dualization or NP-hardness.