Graph clustering via generalized colorings
From MaRDI portal
Publication:2136276
Recommendations
Cites work
- scientific article; zbMATH DE number 2044943 (Why is no real title available?)
- An upper bound on the number of cliques in a graph
- Characterization of forbidden subgraphs for bounded star chromatic number
- Cliques in random graphs
- Difference graphs
- Graph clustering
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- The chromatic number of random graphs
- The probabilistic method
Cited in
(8)- Clustering as a dual problem to colouring
- Цветовая энергия некоторых кластерных графов
- ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
- Clustering on k-Edge-Colored Graphs
- Graph clustering via generalized colorings
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
- Clique clustering yields a PTAS for max-coloring interval graphs
- Clustering on \(k\)-edge-colored graphs
This page was built for publication: Graph clustering via generalized colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136276)