Modularity clustering parameterized by max leaf number

DOI10.4230/LIPICS.IPEC.2024.16MaRDI QIDQ7255452zbMATH OpenFDO

Authors Jaroslav Garvardt, Christian Komusiewicz

Publication date 29 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2024.16

zbMATH Keywords

graph clusteringparameterized complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• A clustering algorithm based on graph connectivity
• Asymptotic modularity of some graph classes
• Bin packing with fixed number of bins revisited
• Cluster graph modification problems
• Fast unfolding of communities in large networks
• Metric dimension parameterized by max leaf number
• Modularity of regular and treelike graphs
• Networks
• On the complexity of Newman's community finding approach for biological and social networks
• Parameterized algorithms
• The complexity ecology of parameters: An illustration using bounded max leaf number
• The parameterised complexity of computing the maximum modularity of a graph

This page was built for publication: Modularity clustering parameterized by max leaf number

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