Algorithm 457: finding all cliques of an undirected graph

Algorithm 457: finding all cliques of an undirected graph Algorithm 457 Finding All Cliques of an Undirected Graph [H] Coen Bron* and Joep Kerboscht [ R e c d . 27 A p r i l 1971 a n d 23 A u g u s t 1971] * Department of Mathematics t Department of Industrial Engineering, Technological University Eindh o v e n , P . O . B o x 513, E i n d h o v e n , T h e N e t h e r l a n d s Present address of C. Bron: Department of Electrical Engineering, Twente University of Technology, P.O. Box 217, Enschade, The Netherlands. removing all points not connected to the selected candidate (to remain consistent with the definition), keeping the old sets in tact. Step 4. Calling the extension operator to operate on the sets just formed. Step 5. Upon return, removal of the selected candidate from compsub and its addition to the old set not. We will now motivate the extra labor involved in maintaining the sets not. A necessary condition for having created a clique is that the set candidates be empty; otherwise compsub could still be extended. This condition, however, is http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM, Volume 16 (9) – Sep 1, 1973

Loading next page...
 
/lp/association-for-computing-machinery/algorithm-457-finding-all-cliques-of-an-undirected-graph-wTBMc8KCZx
Publisher
Association for Computing Machinery
Copyright
Copyright © 1973 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/362342.362367
Publisher site
See Article on Publisher Site

Abstract

Algorithm 457 Finding All Cliques of an Undirected Graph [H] Coen Bron* and Joep Kerboscht [ R e c d . 27 A p r i l 1971 a n d 23 A u g u s t 1971] * Department of Mathematics t Department of Industrial Engineering, Technological University Eindh o v e n , P . O . B o x 513, E i n d h o v e n , T h e N e t h e r l a n d s Present address of C. Bron: Department of Electrical Engineering, Twente University of Technology, P.O. Box 217, Enschade, The Netherlands. removing all points not connected to the selected candidate (to remain consistent with the definition), keeping the old sets in tact. Step 4. Calling the extension operator to operate on the sets just formed. Step 5. Upon return, removal of the selected candidate from compsub and its addition to the old set not. We will now motivate the extra labor involved in maintaining the sets not. A necessary condition for having created a clique is that the set candidates be empty; otherwise compsub could still be extended. This condition, however, is

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Sep 1, 1973

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off