Engineering graph clustering: models and experimental evaluation

MaRDI QIDQ3507780zbMATH OpenFDO

Authors Ulrik Brandes, Marco Gaertler, Dorothea Wagner

Publication date 20 June 2008

Mathematics Subject Classification ID

Connectivity (05C40) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Engineering Comparators for Graph Clusterings
• Graph clustering
• Graph Clustering and Minimum Cut Trees
• A graph clustering algorithm based on a clustering coefficient for weighted graphs

Cited in

(17)

• Coherent network partitions
• Graph clustering via generalized colorings
• Analyzing evolutionary optimization and community detection algorithms using regression line dominance
• Graph ambiguity
• A graph-theoretical clustering method based on two rounds of minimum spanning trees
• Clustering with prim's sequential representation of minimum spanning tree
• Graph clustering via intra-cluster density maximization
• Computational aspects of lucidity-driven graph clustering
• Engineering Comparators for Graph Clusterings
• Solving graph partitioning problems with parallel metaheuristics
• Assessing the quality of multilevel graph clustering
• On the advantage of overlapping clusters for minimizing conductance
• Memetic graph clustering
• Energy Models for Graph Clustering
• A Statistical Performance Analysis of Graph Clustering Algorithms
• Graph Drawing
• A comparison of problem decomposition techniques for the FAP

This page was built for publication: Engineering graph clustering: models and experimental evaluation

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