Cluster graph modification problems

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Discrete Applied Mathematics

• Publication date

  2002-06-13

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.dam.2004.01.007
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Books on Algorithms, Combinatorics, and Related Fields 1. Algorithms: Design Techniques and Analysis by Alsuwaiyel

  2003cited by this paper
• CLICK and EXPANDER: a system for clustering and visualizing gene expression data

  2003cited by this paper
• Cluster Analysis and Mathematical Programming

  2003cited by this paper
• Correlation Clustering

  2002cited by this paper
• Computing phylogenetic roots with bounded degrees and errors is NP-complete

  2001cited by this paper
• CLICK: a clustering algorithm with applications to gene expression analysis.

  2000cited by this paper
• Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling

  2000cited by this paper
• Center CLICK: A Clustering Algorithm with Applications to Gene Expression Analysis

  2000cited by this paper
• Molecular classification of cancer: class discovery and class prediction by gene expression monitoring.

  1999cited by this paper
• Clustering Gene Expression Patterns

  1999cited by this paper
• Complexity classification of some edge modification problems

  1999cited by this paper
• Approximation Algorithms for NP-Hard Problems

  1997cited by this paper
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

  1995cited by this paper
• An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation

  1993cited by this paper
• Discrete Applied Mathematics

  1993cited by this paper
• Optimization, approximation, and complexity classes

  1991cited by this paper
• New spectral methods for ratio cut partitioning and clustering

  1991cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• Graphs and Hypergraphs

  year unknowncited by this paper

• Simple 2-approximations for bad triangle transversals and some hardness results for related problems

  2026influential citation
• When can Cluster Deletion with bounded weights be solved efficiently?

  2026cites this paper
• Fair Correlation Clustering Meets Graph Parameters

  2026cites this paper
• Оценка сложности кластеризации графа в задачах Cluster Deletion и Cluster Editing с ограничениями на размеры кластеров

  2026cites this paper
• Mind the gap and the map: measuring distributional and spatial income polarisation

  2026cites this paper
• Graph Clustering Problems Under the Lens of Parameterized Local Search

  2026cites this paper
• Chromatic correlation clustering via cluster LP

  2025cites this paper
• Cluster deletion and clique partitioning in graphs with bounded clique number

  2025cites this paper
• Preventing Disinformation Spread Across Network Clusters by Strategic Edge Deletions: a Lagrangian Heuristic

  2025cites this paper
• Algorithms and Complexity of Hedge Cluster Deletion Problems

  2025cites this paper
• Algorithms and Hardness Results for the (k,ℓ)-Cover Problem

  2025cites this paper
• A heuristic algorithm for the cluster editing problem

  2025cites this paper
• Intermediate State Formation of Topologically Associated Chromatin Domains using Quantum Annealing

  2025cites this paper
• Approximation algorithms for the cluster editing problem with small clusters

  2025cites this paper
• Anticlustering for sample allocation to minimize batch effects

  2025cites this paper
• Triangle-Covered Graphs: Algorithms, Complexity, and Structure

  2025cites this paper
• A Fixed-Parameter Tractable GA for Data Clustering

  2025cites this paper
• Structural Parameterization of Cluster Deletion

  2025cites this paper
• Approximation Algorithms for Graph Clustering Problems with Clusters of Bounded Size

  2024cites this paper
• Algorithms for 2-club cluster deletion problems using automated generation of branching rules

  2024cites this paper
• Cluster Editing on Cographs and Related Classes

  2024cites this paper
• Bridging Rested and Restless Bandits with Graph-Triggering: Rising and Rotting

  2024cites this paper
• Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better

  2024cites this paper
• Query-Efficient Correlation Clustering with Noisy Oracle

  2024cites this paper
• Editing Problem in Clustering

  2024cites this paper
• Branch-and-cut algorithms for colorful components problems

  2024cites this paper
• γ-clustering problems: Classical and parametrized complexity

  2024influential citation
• A Graph-Theoretic Formulation of Exploratory Blockmodeling

  2023cites this paper
• On the Complexity of the Eigenvalue Deletion Problem

  2023cites this paper
• Faster Approximation Algorithms for Parameterized Graph Clustering and Edge Labeling

  2023influential citation
• Who You Play Affects How You Play: Predicting Sports Performance Using Graph Attention Networks With Temporal Convolution

  2023cites this paper
• Improved Combinatorial Approximations for Weighted Correlation Clustering

  2023cites this paper
• 2k-Vertex Kernels for Cluster Deletion and Strong Triadic Closure

  2023cites this paper
• A combinatorial multi-armed bandit approach to correlation clustering

  2023influential citation
• The Theory of Gene Family Histories

  2023cites this paper
• User-generated short-text classification using cograph editing-based network clustering with an application in invoice categorization

  2023cites this paper
• On the Parameterized Complexity of s-club Cluster Deletion Problems

  2023cites this paper
• A survey of clustering large probabilistic graphs: Techniques, evaluations, and applications

  2023cites this paper
• Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness

  2023cites this paper
• K-Plus anticlustering: An improved k-means criterion for maximizing between-group similarity.

  2023cites this paper
• Bounds for the Clustering Complexity in a Graph Clustering Problem with Clusters of Bounded Size

  2023cites this paper
• Splitting Plane Graphs to Outerplanarity

  2023cites this paper
• Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time

  2022cites this paper
• When Correlation Clustering Meets Fairness Constraints

  2022cites this paper
• s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs

  2022cites this paper
• (1, 1)-Cluster Editing is Polynomial-time Solvable

  2022cites this paper
• Digital topological groups

  2022cites this paper
• On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem

  2022cites this paper
• Correlation Clustering: from Local to Global Constraints

  2022cites this paper
• Polynomial kernels for edge modification problems towards block and strictly chordal graphs

  2022cites this paper
• Correlation Clustering

  2022cites this paper
• Cutting a tree with subgraph complementation is hard, except for some small trees

  2022cites this paper
• A New Temporal Interpretation of Cluster Editing

  2022influential citation
• A quasi-quadratic vertex Kernel for Cograph edge editing

  2022cites this paper
• A Literature Review on Correlation Clustering: Cross-disciplinary Taxonomy with Bibliometric Analysis

  2022cites this paper
• Common-knowledge networks with application to strategic research planning in universities

  2022cites this paper
• Polynomial Kernels for Strictly Chordal Edge Modification Problems

  2021cites this paper
• Faster Deterministic Approximation Algorithms for Correlation Clustering and Cluster Deletion

  2021cites this paper
• On the effectiveness of the incremental approach to minimal chordal edge modification

  2021cites this paper
• An Improved Fixed-Parameter Algorithm for 2-Club Cluster Edge Deletion

  2021cites this paper
• NFR‐aware prioritization of software requirements

  2021cites this paper
• Correlation Clustering with Global Weight Bounds

  2021cites this paper
• The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing

  2021cites this paper
• Spatial Consensus-Prevention in Robotic Swarms

  2021influential citation
• Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds

  2021influential citation
• Implementing and Evaluating Clustering Methods for Large Probabilistic Graphs

  2021cites this paper
• Partition Aggregation for Participatory Budgeting

  2021cites this paper
• Combining Clickstream Analyses and Graph-Modeled Data Clustering for Identifying Common Response Processes

  2021cites this paper
• Using Sequence Mining Techniques for Understanding Incorrect Behavioral Patterns on Interactive Tasks

  2021cites this paper
• Parameterized algorithms for connectivity, separation, and modification problems in graphs

  2021cites this paper
• A survey of parameterized algorithms and the complexity of edge modification

  2020influential citation
• Parameterized Objectives and Algorithms for Clustering Bipartite Graphs and Hypergraphs

  2020cites this paper
• Clustering with a faulty oracle

  2020cites this paper
• Query-Efficient Correlation Clustering

  2020influential citation
• Partition Aggregation for Budgeting

  2020cites this paper
• PolyCluster: Minimum Fragment Disagreement Clustering for Polyploid Phasing

  2020cites this paper
• On Strong Triadic Closure with Edge Insertion

  2020influential citation
• 2-Approximation Algorithms for Two Graph Clustering Problems

  2020cites this paper
• Indirect identification of horizontal gene transfer

  2020cites this paper
• Ensemble-based clustering of large probabilistic graphs using neighborhood and distance metric learning

  2020cites this paper
• An Approximation Algorithm for a Semi-supervised Graph Clustering Problem

  2020cites this paper
• Mathematical Optimization Theory and Operations Research: 19th International Conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020, Revised Selected Papers

  2020cites this paper
• Approximation Algorithm for the Balanced 2-correlation Clustering Problem on Well-Proportional Graphs

  2020cites this paper
• Exact-2-relation graphs

  2020cites this paper
• Parameterized Correlation Clustering in Hypergraphs and Bipartite Graphs

  2020influential citation
• On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering

  2020cites this paper
• On generic NP-completeness of the graph clustering problem

  2020cites this paper
• A hybrid heuristic for the overlapping cluster editing problem

  2019cites this paper
• Applications of MaxSAT in Data Analysis

  2019cites this paper
• Combinatorial Text Classification: the Effect of Multi-Parameterized Correlation Clustering

  2019cites this paper
• Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length

  2019cites this paper
• A 2-Approximation Algorithm for the Graph 2-Clustering Problem

  2019cites this paper
• Polyhedral Attack on the Graph Approximation Problem

  2019cites this paper
• Cluster Deletion on Interval Graphs and Split Related Graphs

  2019cites this paper
• Destroying Bicolored P3s by Deleting Few Edges

  2019cites this paper
• Mathematical Optimization Theory and Operations Research: 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8 - 12, 2019, Revised Selected Papers

  2019influential citation
• 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, Munich, Germany, September 11-13, 2019

  2019cites this paper
• Cluster Editing Parameterized above Modification-disjoint P3-packings

  2019cites this paper
• Discovering Polarized Communities in Signed Networks

  2019cites this paper
• Parameterised Enumeration for Modification Problems

  2019cites this paper