scientific article; zbMATH DE number 1953109

zbMath1022.68104MaRDI QIDQ4414513

Ron Shamir, Dekel Tsur, Roded Sharan

Publication date: 25 July 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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)

Related Items (6)

Cluster graph modification problems ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ Branch-and-price for \(p\)-cluster editing ⋮ A note on the inapproximability of correlation clustering ⋮ Complexity classification of some edge modification problems ⋮ Clustering with qualitative information

This page was built for publication: