A note on improved results for one round distributed clique listing

In this note, we investigate listing cliques of arbitrary sizes in bandwidth-limited, dynamic networks. The problem of detecting and listing triangles and cliques was originally studied in great detail by Bonne and Censor-Hillel (ICALP 2019). We extend this study to dynamic graphs where more than on...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 181; p. 106355
Main Author:	Liu, Quanquan C.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2023
Subjects:	Clique counting Distributed algorithms Dynamic algorithms Graph algorithms Triangle counting Dynamic algorithms Graph algorithms Clique counting Triangle counting Distributed algorithms
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!