Imagen de Portada

On the Complexity of 2-club Cluster Editing with Vertex Splitting

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Abu-Khzam, Faisal N., Davot, Tom, Isenmann, Lucas, Thoumi, Sergio
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Bicluster Editing with Overlaps: A Vertex Splitting Approach
por: Abu-Khzam, Faisal N., et al.
Publicado: (2025)

On the Complexity of Claw-Free Vertex Splitting
por: Abu-Khzam, Faisal N., et al.
Publicado: (2025)

Domination in Diameter-Two Graphs and the 2-Club Cluster Vertex Deletion Parameter
por: Abu-Khzam, Faisal N., et al.
Publicado: (2024)

The Complexity of Cluster Vertex Splitting and Company
por: Firbas, Alexander, et al.
Publicado: (2023)

On the Complexity of Vertex-Splitting Into an Interval Graph
por: Abu-Khzam, Faisal N., et al.
Publicado: (2026)

On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
por: Firbas, Alexander, et al.
Publicado: (2024)

Bandwidth Parameterized by Cluster Vertex Deletion Number
por: Gima, Tatsuya, et al.
Publicado: (2023)

Inclusive and Exclusive Vertex Splitting into Specific Graph Classes: NP Hardness and Algorithms
por: Gaikwad, Ajinkya, et al.
Publicado: (2025)

Pack and Measure: An Effective Approach for Influence Propagation in Social Networks
por: Abu-Khzam, Faisal N., et al.
Publicado: (2023)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
por: Lehner, Lisa, et al.
Publicado: (2025)

Cluster Editing on Cographs and Related Classes
por: Lafond, Manuel, et al.
Publicado: (2024)

Parameterized Algorithms for Editing to Uniform Cluster Graph
por: Gaikwad, Ajinkya, et al.
Publicado: (2024)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
por: Dey, Palash, et al.
Publicado: (2026)

Parameterized Vertex Integrity Revisited
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Parameterized Capacitated Vertex Cover Revisited
por: Lampis, Michael, et al.
Publicado: (2026)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
por: Le, Hoang-Oanh, et al.
Publicado: (2024)

Parameterized Max Min Feedback Vertex Set
por: Lampis, Michael, et al.
Publicado: (2023)

Exact Algorithms for Distance to Unique Vertex Cover
por: Fioravantes, Foivos, et al.
Publicado: (2025)

Complexity of Local Search for Euclidean Clustering Problems
por: Manthey, Bodo, et al.
Publicado: (2023)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
por: Dey, Palash, et al.
Publicado: (2024)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
por: Aute, Shubhada, et al.
Publicado: (2026)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
por: Clinch, Katie, et al.
Publicado: (2025)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number
por: Tale, Prafullkumar
Publicado: (2025)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
por: Bai, Tian, et al.
Publicado: (2026)

The Complexity of Finding and Counting Subtournaments
por: Döring, Simon, et al.
Publicado: (2025)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
por: Chu, Huairui, et al.
Publicado: (2023)

Asymmetric Number Partitioning with Splitting and Interval Targets
por: Bismuth, Samuel, et al.
Publicado: (2022)

Clustering with Locally Bounded Ignorance
por: Garvardt, Jaroslav, et al.
Publicado: (2026)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
por: Gadekar, Ameet, et al.
Publicado: (2025)

Parameterized Complexity of Vehicle Routing
por: Döring, Michelle, et al.
Publicado: (2025)

On the Parameterized Complexity of Odd Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2025)

On the Complexity of Signed Roman Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)

On the Space Complexity of Online Convolution
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Computational Complexity in Property Testing
por: Pinto Jr., Renato Ferreira, et al.
Publicado: (2025)

The Computational Complexity of Almost Stable Clustering with Penalties
por: Khodamoradi, Kamyar, et al.
Publicado: (2025)

The Fine-Grained Complexity of Episode Matching
por: Bille, Philip, et al.
Publicado: (2021)

On the Parameterized Complexity of Min-Sum-Radii
por: Kumar, Pankaj, et al.
Publicado: (2026)

The Complexity of Counting Small Sub-Hypergraphs
por: Bressan, Marco, et al.
Publicado: (2025)