Computational aspects of lucidity-driven graph clustering

DOI10.7155/JGAA.00203zbMATH Open1185.68480OpenAlexW2122995595MaRDI QIDQ3402379FDOQ3402379

Authors: Robert Görke, Marco Gaertler, Florian Hübner, Dorothea Wagner 

Publication date: 4 February 2010

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/230205

Recommendations

• Significance-Driven Graph Clustering
• Graph clustering
• Engineering graph clustering: models and experimental evaluation
• On Finding Graph Clusterings with Maximum Modularity
• Axioms for graph clustering quality functions

zbMATH Keywords

lucidity paradigm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

This page was built for publication: Computational aspects of lucidity-driven graph clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3402379)