A Distributed Algorithm for finding All Maximal Cliques in a Network Graph

Authors:
Esther Jennings;Lenka Motyckova
Affiliations:
-;-
Venue:
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Year:
1992

Citing 0
Cited 3

All maximal independent sets and dynamic dominance for sparse graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
All maximal independent sets and dynamic dominance for sparse graphs

ACM Transactions on Algorithms (TALG)
An autonomy-oriented computing approach to community mining in distributed and dynamic networks

Autonomous Agents and Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract