Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World
  Graphs: Theory and Experiments   Finding large "cliquish" subgraphs is a central topic in graph mining and
community detection. A popular clique relaxation are 2-clubs: instead of asking
for subgraphs of diameter one (these are cliques), one asks for subgraphs of
diameter at most two (these are 2-clubs). A drawback of the 2-club model is
that it produces star-like hub-and-spoke structures as maximum-cardinality
solutions. Hence, we study 2-clubs with the additional constraint to be
well-connected. More specifically, we investigate the algorithmic complexity
for three variants of well-connected 2-clubs, all established in the
literature: robust, hereditary, and "connected" 2-clubs. Finding these more
cohesive 2-clubs is NP-hard; nevertheless, we develop an exact combinatorial
algorithm, extensively using efficient data reduction rules. Besides several
theoretical insights we provide a number of empirical results based on an
engineered implementation of our exact algorithm. In particular, the algorithm
significantly outperforms existing algorithms on almost all (sparse) real-world
graphs we considered.

36
The categories of this paper are: cmp-lg
3
The categories of this paper are: physics
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ
31
The categories of this paper are: ao-sci
4
The categories of this paper are: cond-mat
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
32
The categories of this paper are: atom-ph
30
The categories of this paper are: q-alg
15
The categories of this paper are: nucl-ex
22
The categories of this paper are: chao-dyn
11
The categories of this paper are: hep-lat
27
The categories of this paper are: comp-gas
2
The categories of this paper are: math
34
The categories of this paper are: chem-ph