Skip to Main content Skip to Navigation
New interface
Conference papers

Clustering on k-edge-colored graphs

Abstract : We study the Max k-colored clustering problem, where, given an edge-colored graph with k colors, we seek to color the vertices of the graph so as to find a clustering of the vertices maximizing the number (or the weight) of matched edges, i.e. the edges having the same color as their extremities. We show that the cardinality problem is NP-hard even for edge-colored bipartite graphs with a chromatic degree equal to two and k ≥ 3. Our main result is a constant approximation algorithm for the weighted version of the Max k-colored clustering problem which is based on a rounding of a natural linear programming relaxation. For graphs with chromatic degree equal to two, we improve this ratio by exploiting the relation of our problem with the Max 2-and problem. We also present a reduction to the maximum-weight independent set (IS) problem in bipartite graphs which leads to a polynomial time algorithm for the case of two colors.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Tuesday, March 18, 2014 - 6:00:29 PM
Last modification on : Sunday, June 26, 2022 - 10:02:11 AM
Long-term archiving on: : Wednesday, June 18, 2014 - 10:36:46 AM


Files produced by the author(s)



Eric Angel, Evripidis Bampis, Alexander Kononov, Dimitris Paparas, Emmanouil Pountourakis, et al.. Clustering on k-edge-colored graphs. 38th international Symposium on Mathematical Foundations of Computer Science, Aug 2013, Klosterneuburg, Austria. pp.50--61, ⟨10.1007/978-3-642-40313-2_7⟩. ⟨hal-00832157⟩



Record views


Files downloads