Finding \(k\)-community structures in special graph classes

DOI10.1016/j.dam.2024.07.033MaRDI QIDQ6633530

Clément Dallard, Narmina Baghirova, Bernard Ries, David Schindl

Publication date: 6 November 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmsgraph partitioningcommunity structureforeststhreshold graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• A general view on computing communities
• The balanced satisfactory partition problem
• Algorithmic approach to the satisfactory graph partitioning problem
• Structural and algorithmic properties of 2-community structures
• Threshold graphs and related topics
• A note on the satisfactory partition problem: constant size requirement
• Graphs without a partition into two proportionally dense subgraphs
• Practical graph isomorphism. II.
• The satisfactory partition problem
• Parameterized complexity of satisfactory partition problem
• Locally checkable problems parameterized by clique-width

This page was built for publication: Finding \(k\)-community structures in special graph classes