Maximum Signed $\theta$-Clique Identification in Large Signed Graphs (Extended abstract).

Chen Chen Yanping Wu Renjie Sun Xiaoyang Wang

Published in: ICDE (2022)

Keyphrases

extended abstract
independent set
directed graph
information systems
pairwise
worst case
maximum number
upper bound
maximum clique
graph properties