Clustering on k-Edge-Colored Graphs
From MaRDI portal
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
Cited in
(10)- Maximum colorful cliques in vertex-colored graphs
- Clustering as a dual problem to colouring
- 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 on \(k\)-edge-colored graphs
- Improved approximations for the max \(k\)-colored clustering problem
- A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- The multicolored graph realization problem
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 Q2849897)
