Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Fairness-aware Maximal Clique Enumeration   Cohesive subgraph mining on attributed graphs is a fundamental problem in
graph data analysis. Existing cohesive subgraph mining algorithms on attributed
graphs do not consider the fairness of attributes in the subgraph. In this
paper, we for the first time introduce fairness into the widely-used clique
model to mine fairness-aware cohesive subgraphs. In particular, we propose two
novel fairness-aware maximal clique models on attributed graphs, called weak
fair clique and strong fair clique respectively. To enumerate all weak fair
cliques, we develop an efficient backtracking algorithm called WFCEnum equipped
with a novel colorful k-core based pruning technique. We also propose an
efficient enumeration algorithm called SFCEnum to find all strong fair cliques
based on a new attribute-alternatively-selection search technique. To further
improve the efficiency, we also present several non-trivial ordering techniques
for both weak and strong fair clique enumeration. The results of extensive
experiments on four real-world graphs demonstrate the efficiency and
effectiveness of the proposed algorithms.

25
The categories of this paper are: patt-sol
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
2
The categories of this paper are: math
6
The categories of this paper are: astro-ph
0
The categories of this paper are: hep-ph
29
The categories of this paper are: funct-an
7
The categories of this paper are: hep-th
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
9
The categories of this paper are: nlin
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph