☆ 4.3 Article

Algorithms for 2-club cluster deletion problems using automated generation of branching rules

THEORETICAL COMPUTER SCIENCE (2024)

Related references

Note: Only part of the references are listed.

Article Computer Science, Theory & Methods

An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion

Faisal N. Abu-Khzam et al.

Summary: A 2-club is a graph with diameter at most two. In the decision version of the 2-CLUB CLUSTER EDGE DELETION problem, it is asked whether an undirected graph G can be transformed into a disjoint union of 2-clubs by deleting at most k edges. This paper presents a fixed-parameter algorithm that breaks the 3k barrier and improves the previously claimed running time to O*(2.692k).

THEORETICAL COMPUTER SCIENCE (2023)

Add to Collection

Article Computer Science, Theory & Methods

Faster parameterized algorithms for BICLUSTER EDITING and FLIP CONSENSUS TREE

Dekel Tsur

Summary: This paper addresses the BICLUSTER EDITING and FLIP CONSENSUS TREE problems and presents algorithms with running times of O*(2.22k) and O(3.24k) respectively, improving upon previous algorithms.

THEORETICAL COMPUTER SCIENCE (2023)

Add to Collection

Article Computer Science, Information Systems

Cluster deletion revisited

Dekel Tsur

Summary: The paper presents an algorithm for solving the CLUSTER DELETION problem with a running time of O*(1.404(k)).

INFORMATION PROCESSING LETTERS (2022)

Add to Collection

Article Computer Science, Theory & Methods

Faster Parameterized Algorithm for Cluster Vertex Deletion

Dekel Tsur

Summary: The Cluster Vertex Deletion problem involves finding a set of at most k vertices whose removal results in connected components that are all cliques. We have developed an algorithm for Cluster Vertex Deletion with a running time of O*(1.811(k)).

THEORY OF COMPUTING SYSTEMS (2021)

Add to Collection

Article Computer Science, Hardware & Architecture

Subexponential algorithm for d-cluster edge deletion: Exception or rule?

Neeldhara Misra et al.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2020)

Add to Collection

Article Computer Science, Theory & Methods

A Fast Branching Algorithm for Cluster Vertex Deletion

Anudhyan Boral et al.

THEORY OF COMPUTING SYSTEMS (2016)

Add to Collection

Article Mathematics, Applied

A golden ratio parameterized algorithm for Cluster Editing

Sebastian Boecker

JOURNAL OF DISCRETE ALGORITHMS (2012)

Add to Collection

Article Computer Science, Software Engineering

Editing Graphs into Disjoint Unions of Dense Clusters

Jiong Guo et al.

ALGORITHMICA (2011)

Add to Collection

Article Operations Research & Management Science

Graph-based data clustering with overlaps

Michael R. Fellows et al.

DISCRETE OPTIMIZATION (2011)

Add to Collection

Article Computer Science, Information Systems

Even faster parameterized cluster deletion and cluster editing

Sebastian Boecker et al.

INFORMATION PROCESSING LETTERS (2011)

Add to Collection

Article Mathematics, Applied

A MORE RELAXED MODEL FOR GRAPH-BASED DATA CLUSTERING: s-PLEX CLUSTER EDITING

Jiong Guo et al.

SIAM JOURNAL ON DISCRETE MATHEMATICS (2010)

Add to Collection

Article Computer Science, Theory & Methods

Fixed-Parameter Algorithms for Cluster Vertex Deletion

Falk Hueffner et al.

THEORY OF COMPUTING SYSTEMS (2010)

Add to Collection

Article Computer Science, Theory & Methods

Going weighted: Parameterized algorithms for cluster editing

S. Boecker et al.

THEORETICAL COMPUTER SCIENCE (2009)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Novel approaches for analyzing biological networks

B Balasundaram et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2005)

Add to Collection

Article Computer Science, Theory & Methods

Graph-modeled data clustering:: Exact algorithms for clique generation

J Gramm et al.

THEORY OF COMPUTING SYSTEMS (2005)

Add to Collection

Article Computer Science, Software Engineering

Automated generation of search tree algorithms for hard graph modification problems

J Gramm et al.

ALGORITHMICA (2004)

Add to Collection

Article Mathematics, Applied

Cluster graph modification problems

R Shamir et al.

DISCRETE APPLIED MATHEMATICS (2004)

Add to Collection

© Peeref 2019-2024. All rights reserved.