On solving simplified diversified top-\(k\,s\)-plex problem
From MaRDI portal
Publication:6164387
DOI10.1016/j.cor.2023.106187MaRDI QIDQ6164387
Jun Wu, Peng Zhao, Minghao Yin, Luzhi Wang, Shuli Hu, Chu-Min Li
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- Multi-neighborhood tabu search for the maximum weight clique problem
- Heuristics for finding \(k\)-clubs in an undirected graph
- Local search for diversified top-\(k\) clique search problem
- Mining market data: a network approach
- Clique Relaxation Models in Social Network Analysis
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- A threshold of ln n for approximating set cover
- A graph‐theoretic generalization of the clique concept
- Greedy and heuristic algorithms for codes and colorings
- Optimal Protein Structure Alignment Using Maximum Cliques
- Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess
This page was built for publication: On solving simplified diversified top-\(k\,s\)-plex problem
