New Insight into 2-Community Structures in Graphs with Applications in Social Networks
DOI10.1007/978-3-319-26626-8_18zbMath1478.05115OpenAlexW2173452288MaRDI QIDQ3467849
Janka Chlebíková, Thomas Pontoizeau, Cristina Bazgan
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/16151
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Graph clustering
- A general view on computing communities
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- Balanced graph partitioning
- Approximation of satisfactory bisection problems
- Satisfactory graph partition, variants, and generalizations
- Balanced partitions of trees and applications
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity
- The satisfactory partition problem
This page was built for publication: New Insight into 2-Community Structures in Graphs with Applications in Social Networks
