1 Introduction

2 Preliminaries
2.2 Cohesiveness and Computational Efficiency

3 κ-Core-Based Community Search
3.1 Undirected Graphs
3.4 Location-Based Attributed Graphs
3.5 Temporal Graphs
3.8 Discussions

4 κ-Truss-Based Community Search
4.1 Simple Graphs
4.2 Closest Truss Community Search
4.3 Keyword-Based Attributed Graphs
4.5 Discussions

5 κ-Clique-Based Community Search
5.1 K-Clique and Its Variants
5.2 K-Clique-Based Community Search
5.5 Discussions

6 κ-ECC-Based Community Search
6.1 Maximum SMCS
6.2 Minimum and Minimal SMCS's
6.3 Discussions

7 Other Metrics-Based Community Search
7.1 Local Modularity-Based Community Search
7.2 Query Biased Density-Based Community Search
7.3 Personalized PageRank-Based Community Search
7.4 Discussions

8 Community Search Systems
8.2 VizCS

9 Comparison Analysis
9.1 Simple Graphs
9.2 Attributed Graphs

10 Related Work
10.1 Community Detection
10.2 Cohesive Subgraph Discovery
10.3 Graph Keyword Search
10.4 Graph Pattern Matching (GPM)

11 Future Work
11.1 Optimization for Query Parameters
11.2 More Cohesiveness Metrics
11.3 Other Types of Graphs
11.4 Real Big Graphs
11.5 An Online Repository for Codes and Datasets

12 Conclusion