Graph clustering via generalized colorings

London, András and Martin, Ryan Robert and Pluhár, András (2022) Graph clustering via generalized colorings. THEORETICAL COMPUTER SCIENCE, 918. pp. 94-104. ISSN 0304-3975

Text 2103.08005v1.pdf - Published Version Restricted to Repository staff only Download (211kB) | Request a copy

Abstract

We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts of a graph, we concentrate on the structure of edges between the clusters, as it is motivated by some earlier observations, e.g. in the structure of networks in ecology and economics and by applications of discrete tomography. Mathematically special colorings and chromatic numbers of graphs are studied.

Actions (login required)

Edit Item