许绍廖小邵志华强金海(2022)Maximal clique enumeration problem on graphs: status and challengesSCIENTIA SINICA Informationis10.1360/SSI-2021-015552:5(784)Online publication date: 14-Apr-2022
https://doi.org/10.1360/SSI-2021-0155
Valiente GValiente G(2021)Clique, Independent Set, and Vertex CoverAlgorithms on Trees and Graphs10.1007/978-3-030-81885-2_6(219-254)Online publication date: 12-Oct-2021
https://doi.org/10.1007/978-3-030-81885-2_6
Conte AGrossi RMarino AVersari L(2020)Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in GraphsAlgorithmica10.1007/s00453-019-00656-882:6(1547-1573)Online publication date: 1-Jun-2020
https://dl.acm.org/doi/10.1007/s00453-019-00656-8
Show More Cited By

Index Terms

Corrections to Bierstone's Algorithm for Generating Cliques
1. Mathematics of computing
  1. Discrete mathematics
  2. Probability and statistics

Recommendations

M-CLIQUES: Modified CLIQUES key agreement for secure multicast

In secure multicast applications, members may join or leave frequently and key management is one of the most challenging problems. In this research, we proposed a modified CLIQUES key management protocol. It was the modification of CLIQUES that ...
A Security Analysis of the Cliques Protocols Suites
CSFW '01: Proceedings of the 14th IEEE workshop on Computer Security Foundations

Abstract: Secure group protocols are not easy to design: this paper will show new attacks found against a protocol suite for sharing key. The method we propose to analyse these protocols is very systematic, and can be applied to numerous protocols of ...
Fast Algorithm for Generating Ascending Compositions

In this paper we give a fast algorithm to generate all partitions of a positive integer n. Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. It is known that the ascending ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 19, Issue 2

April 1972

191 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321694

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1972

Published in JACM Volume 19, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
796
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)8

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

许绍廖小邵志华强金海(2022)Maximal clique enumeration problem on graphs: status and challengesSCIENTIA SINICA Informationis10.1360/SSI-2021-015552:5(784)Online publication date: 14-Apr-2022
https://doi.org/10.1360/SSI-2021-0155
Valiente GValiente G(2021)Clique, Independent Set, and Vertex CoverAlgorithms on Trees and Graphs10.1007/978-3-030-81885-2_6(219-254)Online publication date: 12-Oct-2021
https://doi.org/10.1007/978-3-030-81885-2_6
Conte AGrossi RMarino AVersari L(2020)Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in GraphsAlgorithmica10.1007/s00453-019-00656-882:6(1547-1573)Online publication date: 1-Jun-2020
https://dl.acm.org/doi/10.1007/s00453-019-00656-8
Liu ZHuang Y(2013)Mining Co-locations under UncertaintyProceedings of the 13th International Symposium on Advances in Spatial and Temporal Databases - Volume 809810.5555/2960717.2960749(429-446)Online publication date: 21-Aug-2013
https://dl.acm.org/doi/10.5555/2960717.2960749
Eppstein DLöffler MStrash D(2013)Listing All Maximal Cliques in Large Sparse Real-World GraphsACM Journal of Experimental Algorithmics10.1145/254362918(3.1-3.21)Online publication date: 28-Nov-2013
https://dl.acm.org/doi/10.1145/2543629
Liu ZHuang Y(2013)Mining Co-locations under UncertaintyAdvances in Spatial and Temporal Databases10.1007/978-3-642-40235-7_25(429-446)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40235-7_25
Eswaran SMisra ABergamaschi FPorta T(2012)Utility-based bandwidth adaptation in mission-oriented wireless sensor networksACM Transactions on Sensor Networks10.1145/2140522.21405308:2(1-26)Online publication date: 31-Mar-2012
https://dl.acm.org/doi/10.1145/2140522.2140530
Nahrstedt K(2011)Quality of Service in Wireless Networks Over Unlicensed SpectrumSynthesis Lectures on Mobile and Pervasive Computing10.2200/S00383ED1V01Y201109MPC0086:1(1-176)Online publication date: 30-Nov-2011
https://doi.org/10.2200/S00383ED1V01Y201109MPC008
David ARoucairol C(2011)Un algorithme d'aide à la conception en architectureRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle10.1051/ro/197307V3006917:V3(69-81)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/197307V300691
Haouari MSherali HMansour FAissaoui N(2011)Exact approaches for integrated aircraft fleeting and routing at TunisAirComputational Optimization and Applications10.1007/s10589-009-9292-z49:2(213-239)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1007/s10589-009-9292-z
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

M-CLIQUES: Modified CLIQUES key agreement for secure multicast

A Security Analysis of the Cliques Protocols Suites

Fast Algorithm for Generating Ascending Compositions

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations