Image de couverture de livre

The Complexity of Maximal Common Subsequence Enumeration

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Buzzega, Giovanni, Conte, Alessio, Kobayashi, Yasuaki, Kurita, Kazuhiro, Punzi, Giulia
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Finding One Local Optimum Is Easy -- but What About Two?
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
par: Kurita, Kazuhiro, et autres
Publié: (2025)

Finding Diverse Strings and Longest Common Subsequences in a Graph
par: Shida, Yuto, et autres
Publié: (2024)

Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids and Beyond
par: Kobayashi, Yasuaki, et autres
Publié: (2023)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
par: Conte, Alessio, et autres
Publié: (2024)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
par: Kobayashi, Yasuaki, et autres
Publié: (2020)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
par: Hanaka, Tesshu, et autres
Publié: (2023)

Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
par: Kobayashi, Yasuaki, et autres
Publié: (2023)

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
par: Brosse, Caroline, et autres
Publié: (2024)

Recognizing 2-Layer and Outer $k$-Planar Graphs
par: Kobayashi, Yasuaki, et autres
Publié: (2024)

Local Enumeration: The Not-All-Equal Case
par: Gurumukhani, Mohit, et autres
Publié: (2025)

Complexity of Finding and Enumerating Interconnection Trees
par: Demange, Noé, et autres
Publié: (2026)

From Amortized to Worst Case Delay in Enumeration Algorithms
par: Capelli, Florent, et autres
Publié: (2021)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
par: Dey, Palash, et autres
Publié: (2026)

Emit As You Go: Enumerating Edges of a Spanning Tree
par: Casel, Katrin, et autres
Publié: (2025)

Enumerating models of DNF faster: breaking the dependency on the formula size
par: Capelli, Florent, et autres
Publié: (2018)

Broadcasting under Structural Restrictions
par: Egami, Yudai, et autres
Publié: (2025)

Maximization of Approximately Submodular Functions
par: Horel, Thibaut, et autres
Publié: (2024)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Minimizing Envy and Maximizing Happiness in Graphical House Allocation
par: Dhar, Anubhav, et autres
Publié: (2025)

Submodular Maximization under Supermodular Constraint: Greedy Guarantees
par: Srivastava, Ajitesh, et autres
Publié: (2026)

Finding Maximum Common Contractions Between Phylogenetic Networks
par: Marchand, Bertrand, et autres
Publié: (2024)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
par: Kurita, Kazuhiro, et autres
Publié: (2022)

Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
par: Chauhan, Archit, et autres
Publié: (2025)

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
par: Komoto, Kenta, et autres
Publié: (2026)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

The Complexity of Finding and Counting Subtournaments
par: Döring, Simon, et autres
Publié: (2025)

On the Parameterized Complexity of Odd Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2025)

On the Complexity of Signed Roman Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

On the Space Complexity of Online Convolution
par: Andersson, Joel Daniel, et autres
Publié: (2025)

Computational Complexity in Property Testing
par: Pinto Jr., Renato Ferreira, et autres
Publié: (2025)

The Complexity of Counting Small Sub-Hypergraphs
par: Bressan, Marco, et autres
Publié: (2025)

The Fine-Grained Complexity of Episode Matching
par: Bille, Philip, et autres
Publié: (2021)

On the Parameterized Complexity of Min-Sum-Radii
par: Kumar, Pankaj, et autres
Publié: (2026)

Novel Complexity Results for Temporal Separators with Deadlines
par: Dondi, Riccardo, et autres
Publié: (2025)

Complexity of Local Search for Euclidean Clustering Problems
par: Manthey, Bodo, et autres
Publié: (2023)

Streaming Complexity Separations for Dense and Sparse Graphs
par: Liu, Yang P., et autres
Publié: (2026)

The Query Complexity of Local Search and Brouwer in Rounds
par: Brânzei, Simina, et autres
Publié: (2020)

On the Complexity of Fundamental Problems for DAG-Compressed Graphs
par: Chudigiewitsch, Florian, et autres
Publié: (2026)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
par: Nederlof, Jesper
Publié: (2026)