Asymptotic Modularity of Some Graph Classes

DOI10.1007/978-3-642-25591-5_45zbMath1349.05281OpenAlexW1608017095MaRDI QIDQ3104638

Laurent Viennot, Fabien de Montgolfier, Mauricio Soto

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-00909733/file/isaac2011AsymptoticModularity.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (14)

Multilayer Modularity Belief Propagation to Assess Detectability of Community Structure ⋮ The hyperbolicity constant of infinite circulant graphs ⋮ Differential geometric treewidth estimation in adiabatic quantum computation ⋮ Post-processing partitions to identify domains of modularity optimization ⋮ On the modularity of 3‐regular random graphs and random graphs with given degree sequences ⋮ Unnamed Item ⋮ Modularity in several random graph models ⋮ Modularity of minor‐free graphs ⋮ Bad communities with high modularity ⋮ Unnamed Item ⋮ Modularity of Erdős‐Rényi random graphs ⋮ On Computing the Gromov Hyperbolicity ⋮ New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) ⋮ Spectrum of Johnson graphs

This page was built for publication: Asymptotic Modularity of Some Graph Classes