Computing cliques and cavities in networks

Dinghua Shi; Zhifeng Chen; Xiang Sun; Qinghua Chen; Chuang Ma; Yang Lou; Guanrong Chen

doi:10.1038/s42005-021-00748-4

Communications Physics (Nov 2021)

Computing cliques and cavities in networks

Dinghua Shi,
Zhifeng Chen,
Xiang Sun,
Qinghua Chen,
Chuang Ma,
Yang Lou,
Guanrong Chen

Affiliations

Dinghua Shi: Department of Mathematics, College of Science, Shanghai University
Zhifeng Chen: Department of Statistics, School of Mathematics and Statistics, Fujian Normal University
Xiang Sun: Department of Statistics, School of Mathematics and Statistics, Fujian Normal University
Qinghua Chen: Department of Statistics, School of Mathematics and Statistics, Fujian Normal University
Chuang Ma: Department of Internet Finance, School of Internet, Anhui University
Yang Lou: Department of Computing and Decision Sciences, Lingnan University of Hong Kong
Guanrong Chen: Department of Electrical Engineering, City University of Hong Kong

DOI: https://doi.org/10.1038/s42005-021-00748-4
Journal volume & issue: Vol. 4, no. 1
pp. 1 – 7

Abstract

Read online

The study of high-order networks as attracted significant attention recently. The authors introduce the concept of computability for searching maximum clique in large networks and an optimized algorithm for finding cavities with different orders.

Published in Communications Physics

ISSN: 2399-3650 (Online)
Publisher: Nature Portfolio
Country of publisher: United Kingdom
LCC subjects: Science: Astronomy: Astrophysics; Science: Physics
Website: https://www.nature.com/commsphys/

About the journal