Incremental maintenance of maximal cliques in a dynamic graph
10.1007/s00778-019-00540-5
Saved in:
Main Authors: | Das, Apurba, Svendsen, Michael, Tirthapura, Srikanta |
---|---|
Other Authors: | DEPT OF COMPUTER SCIENCE |
Format: | Article |
Published: |
Springer Science and Business Media LLC
2019
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/155406 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Work-efficient parallel union-find with applications to incremental graph connectivity
by: Natcha Simsiri, et al.
Published: (2018) -
Clique coverings and clique partitions of the K-power of graphs
by: Tanawat Wichianpaisarn
Published: (2014) -
Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
by: Greaves, Gary Royden Watson, et al.
Published: (2022) -
Minimum 2-clique and 3-clique partitions of simple connected graphs
by: Alto, Washington Lee
Published: (1992) -
Clique partitions of glued graphs
by: Uthoomporn Jongthawonwuth
Published: (2012)