Finding Disjoint Dense Clubs in an Undirected Graph
From MaRDI portal
Publication:4632197
DOI10.1007/978-3-319-39817-4_27zbMath1475.68256OpenAlexW2501435209MaRDI QIDQ4632197
Binhai Zhu, Chunlin Xin, Hui Li, Wencheng Wang, Peng Zou
Publication date: 26 April 2019
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://scholarworks.montana.edu/xmlui/handle/1/9896
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
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
