Graph clustering via generalized colorings

DOI10.1016/J.TCS.2022.03.023OpenAlexW3136280403MaRDI QIDQ2136276FDOQ2136276

András London, András Pluhár, Ryan R. Martin

Publication date: 10 May 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.08005

zbMATH Keywords

graph clusteringnestednesscoloringspecial graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Graph clustering
• Title not available (Why is that?)
• The probabilistic method
• Cliques in random graphs
• The chromatic number of random graphs
• Difference graphs
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• An upper bound on the number of cliques in a graph
• Characterization of forbidden subgraphs for bounded star chromatic number

Cited In (8)

• Clustering on k-Edge-Colored Graphs
• Clique clustering yields a PTAS for max-coloring interval graphs
• Graph clustering via generalized colorings
• Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
• Clustering on \(k\)-edge-colored graphs
• Цветовая энергия некоторых кластерных графов
• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• Clustering as a dual problem to colouring

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)