Finding disjoint dense clubs in a social network
From MaRDI portal
Publication:2636493
DOI10.1016/j.tcs.2017.10.018zbMath1393.68084OpenAlexW2765932048MaRDI QIDQ2636493
Chunlin Xin, Hui Li, Binhai Zhu, Wencheng Wang, Peng Zou
Publication date: 5 June 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.10.018
Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Covering a graph with densest subgraphs ⋮ Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem ⋮ Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem ⋮ On the tractability of covering a graph with 2-clubs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Finding large \(k\)-clubs in undirected graphs
- On problems without polynomial kernels
- The maximum clique problem
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Parameterized computational complexity of finding small-diameter subgraphs
- Heuristics for finding \(k\)-clubs in an undirected graph
- Parametrized complexity theory.
- Novel approaches for analyzing biological networks
- A review on algorithms for maximum clique problems
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
- On Editing Graphs into 2-Club Clusters
- A graph‐theoretic definition of a sociometric clique†
- A graph‐theoretic generalization of the clique concept
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Reducibility among Combinatorial Problems
This page was built for publication: Finding disjoint dense clubs in a social network
