Copertina

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Komoto, Kenta, Kurita, Kazuhiro, Ono, Hirotaka
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the Complexity of Minimising the Moving Distance for Dispersing Objects
di: Honorato-Droguett, Nicolás, et al.
Pubblicazione: (2025)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
di: Honorato-Droguett, Nicolás, et al.
Pubblicazione: (2023)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
di: Kobayashi, Yasuaki, et al.
Pubblicazione: (2023)

The Complexity of Maximal Common Subsequence Enumeration
di: Buzzega, Giovanni, et al.
Pubblicazione: (2025)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
di: Kobayashi, Yasuaki, et al.
Pubblicazione: (2023)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
di: Kurita, Kazuhiro, et al.
Pubblicazione: (2025)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
di: Kurita, Kazuhiro, et al.
Pubblicazione: (2022)

Dichotomies for Tree Minor Containment with Structural Parameters
di: Gima, Tatsuya, et al.
Pubblicazione: (2023)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
di: Kobayashi, Yasuaki, et al.
Pubblicazione: (2020)

On the complexity of finding a spanning even tree in a graph
di: Hanaka, Tesshu, et al.
Pubblicazione: (2024)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
di: Conte, Alessio, et al.
Pubblicazione: (2024)

Fast and Optimal Differentially Private Frequent-Substring Mining
di: Guo, Peaker, et al.
Pubblicazione: (2026)

Sequentially Swapping Tokens: Further on Graph Classes
di: Kiya, Hironori, et al.
Pubblicazione: (2022)

Finding One Local Optimum Is Easy -- but What About Two?
di: Kobayashi, Yasuaki, et al.
Pubblicazione: (2025)

Streaming Maximal Matching with Bounded Deletions
di: Khanna, Sanjeev, et al.
Pubblicazione: (2025)

Computing diverse pair of solutions for tractable SAT
di: Gima, Tatsuya, et al.
Pubblicazione: (2024)

A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees
di: Jaffke, Lars, et al.
Pubblicazione: (2025)

Advances in Exact and Approximate Group Closeness Centrality Maximization
di: Schulz, Christian, et al.
Pubblicazione: (2026)

Exploring Temporal Graphs with Frequent and Regular Edges
di: Adamson, Duncan
Pubblicazione: (2025)

Structural Parameterizations of Vertex Integrity
di: Gima, Tatsuya, et al.
Pubblicazione: (2023)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
di: Hao, Yimin, et al.
Pubblicazione: (2025)

An improved spectral lower bound of treewidth
di: Gima, Tatsuya, et al.
Pubblicazione: (2024)

On Rotation Distance of Rank Bounded Trees
di: M., Anoop S. K., et al.
Pubblicazione: (2023)

Height-bounded Lempel-Ziv encodings
di: Bannai, Hideo, et al.
Pubblicazione: (2024)

Online Coloring for Graphs of Large Odd Girth
di: Yoneda, Hirotaka, et al.
Pubblicazione: (2026)

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
di: Huiberts, Sophie, et al.
Pubblicazione: (2022)

Learning-Augmented Frequent Directions
di: Aamand, Anders, et al.
Pubblicazione: (2025)

Lower Bounds on Tree Covers
di: Chen, Yu, et al.
Pubblicazione: (2025)

Combinatorial Perpetual Scheduling: Existence and Computation of Low-Height Schedules
di: Mendoza-Cadena, Mirabel, et al.
Pubblicazione: (2026)

Query Complexity of the Metric Steiner Tree Problem
di: Chen, Yu, et al.
Pubblicazione: (2022)

Subsequences With Generalised Gap Constraints: Upper and Lower Complexity Bounds
di: Manea, Florin, et al.
Pubblicazione: (2024)

On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs
di: Aminian, Aida, et al.
Pubblicazione: (2025)

Nearly Optimal Bounds for Computing Decision Tree Splits in Data Streams
di: Ta, Hoang, et al.
Pubblicazione: (2026)

Lower Bound Techniques in the Comparison-Query Model and Inversion Minimization on Trees
di: Hu, Ivan, et al.
Pubblicazione: (2022)

Sublinear Metric Steiner Tree via Improved Bounds for Set Cover
di: Mahabadi, Sepideh, et al.
Pubblicazione: (2024)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
di: Kociumaka, Tomasz, et al.
Pubblicazione: (2025)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
di: Mieno, Takuya, et al.
Pubblicazione: (2024)

Two Complexity Results on Spanning-Tree Congestion Problems
di: Atalig, Sunny, et al.
Pubblicazione: (2026)

Profit Maximization in Closed Social Networks
di: Sharma, Poonam, et al.
Pubblicazione: (2026)

Faster Min-Cost Flow and Approximate Tree Decomposition on Bounded Treewidth Graphs
di: Dong, Sally, et al.
Pubblicazione: (2023)