Clustering via the modified Petford-Welsh algorithm

DOI10.26493/1855-3974.2079.7B1zbMath1444.05137OpenAlexW3015189242MaRDI QIDQ3298117

Barbara Ikica

Publication date: 21 July 2020

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.2079.7b1

zbMATH Keywords

simulated annealinggraph algorithmcommunity detectioncomplex networksPetford-Welsh algorithm

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Clustering as a dual problem to colouring

Uses Software

• igraph
• Cython
• GitHub

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A randomised 3-colouring algorithm
• A randomized algorithm for \(k\)-colorability
• Community structure in social and biological networks
• Clustering of sparse data via network communities—a prototype study of a large online market
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Exploring complex networks
• Networks

This page was built for publication: Clustering via the modified Petford-Welsh algorithm