Clustering as a dual problem to colouring

DOI10.1007/s40314-022-01835-0zbMath1499.90052OpenAlexW4224212569MaRDI QIDQ2140780

Janez Povh, Boštjan Gabrovšek, Janez Žerovnik, Barbara Ikica

Publication date: 23 May 2022

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-022-01835-0

zbMATH Keywords

simulated annealinggraph algorithmcommunity detectioncomplex networksPetford-Welsh algorithm

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Randomized algorithms (68W20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Uses Software

• igraph
• Scikit
• Cython
• GitHub
• folium
• GeoPy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Graph clustering
• A randomised 3-colouring algorithm
• A parallel variant of a heuristical algorithm for graph coloring -- corrigendum
• A randomized algorithm for \(k\)-colorability
• Metaheuristic clustering
• Clustering via the modified Petford-Welsh algorithm
• Finite particle systems and infection models
• Community structure in social and biological networks
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Elements of Information Theory
• Network Analysis
• Networks

This page was built for publication: Clustering as a dual problem to colouring