scientific article; zbMATH DE number 1953109

MaRDI QIDQ4414513zbMATH OpenFDO

Authors Ron Shamir, Roded Sharan, Dekel Tsur

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730379.htm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Cluster graph modification problems
• scientific article; zbMATH DE number 2011849
• Graph-modeled data clustering: Exact algorithms for clique generation
• On Editing Graphs into 2-Club Clusters
• Cluster editing with locally bounded modifications

Cited in

(25)

• Cluster graph modification problems
• Clustering with local restrictions
• Branch-and-price for \(p\)-cluster editing
• Clustering with partial information
• A ``maximum node clustering problem
• Clustering with qualitative information
• The complexity of the simultaneous cluster problem
• On the clique editing problem
• Generalized graph clustering: recognizing (p,q)-cluster graphs
• ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
• scientific article; zbMATH DE number 26490 (Why is no real title available?)
• scientific article; zbMATH DE number 2011849 (Why is no real title available?)
• Graph-based data clustering with overlaps
• scientific article; zbMATH DE number 1420899 (Why is no real title available?)
• Complexity of the cluster deletion problem on subclasses of chordal graphs
• Branch-and-cut approaches for p-cluster editing
• 2-approximation algorithms for two graph clustering problems
• Graph-Based Data Clustering with Overlaps
• Editing the simplest graphs
• Complexity classification of some edge modification problems
• scientific article; zbMATH DE number 7746258 (Why is no real title available?)
• Graph-modeled data clustering: Exact algorithms for clique generation
• Sufficient conditions for edit-optimal clusters
• Optimal clustering of multipartite graphs
• A note on the inapproximability of correlation clustering

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414513)