Clustering as a dual problem to colouring
From MaRDI portal
Publication:2140780
Recommendations
- Graph clustering via generalized colorings
- Clustering on k-Edge-Colored Graphs
- Clustering on \(k\)-edge-colored graphs
- Concepts on coloring of cluster hypergraphs with application
- A graph b-coloring framework for data clustering
- Improved approximations for the max \(k\)-colored clustering problem
- Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem
- Clustered colouring of graph classes with bounded treedepth or pathwidth
- A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem
Cites work
- A parallel variant of a heuristical algorithm for graph coloring -- corrigendum
- A randomised 3-colouring algorithm
- A randomized algorithm for \(k\)-colorability
- Clustering via the modified Petford-Welsh algorithm
- Community structure in social and biological networks
- Computing Communities in Large Networks Using Random Walks
- Elements of Information Theory
- Fast unfolding of communities in large networks
- Finite particle systems and infection models
- Graph clustering
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
- Metaheuristic clustering
- Network Analysis
- Network science. With Márton Pósfai
- Networks. An introduction.
- Optimization by simulated annealing
- Scikit-learn: machine learning in Python
Cited in
(3)
This page was built for publication: Clustering as a dual problem to colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140780)
