Clustering on k-edge-colored graphs

DOI10.1016/J.DAM.2016.04.017zbMATH Open1348.05070OpenAlexW2350862829MaRDI QIDQ335326FDOQ335326

Authors: Eric Angel, Evripidis Bampis, Alexander Kononov, D. Paparas, E. Pountourakis, V. Zissimopoulos 

Publication date: 2 November 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.017

Recommendations

• Clustering on k-Edge-Colored Graphs
• Graph clustering via generalized colorings
• On clustering on graphs with multiple edge types
• Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem
• A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem
• A graph b-coloring framework for data clustering
• Clustering as a dual problem to colouring
• scientific article; zbMATH DE number 7746258
• Graph clustering with a constraint on cluster sizes
• Clustering with \(r\)-regular graphs

zbMATH Keywords

clusteringapproximation algorithmscoloring

Mathematics Subject Classification ID

Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Correlation clustering
• Title not available (Why is that?)
• Information-sharing in social networks
• Improved approximations for the max \(k\)-colored clustering problem

Cited In (12)

• The multicolored graph realization problem
• Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem
• Chromatic kernel and its applications
• On the complexity of edge-colored subgraph partitioning problems in network optimization
• Clustering in Hypergraphs to Minimize Average Edge Service Time
• Clustering on k-Edge-Colored Graphs
• Maximum colorful cliques in vertex-colored graphs
• Non-existence of stable social groups in information-driven networks
• How long does it take for all users in a social network to choose their communities?
• Improved approximations for the max \(k\)-colored clustering problem
• A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem
• Clustering as a dual problem to colouring

This page was built for publication: Clustering on \(k\)-edge-colored graphs

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