Amanote Research

Amanote Research

    RegisterSign In

Implementation Issues of Clique Enumeration Algorithm

Progress in Informatics
doi 10.2201/niipi.2012.9.5
Full Text
Open PDF
Abstract

Available in full text

Date

March 1, 2012

Authors
Takeaki UNO
Publisher

National Institute of Informatics (NII)


Related search

Efficient Maximal Clique Enumeration Over Graph Data

Data Science and Engineering
Computational MechanicsComputer Science Applications
2016English

An Improved Bit Parallel Exact Maximum Clique Algorithm

Optimization Letters
ControlOptimization
2011English

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

A Note on the Todd-Coxeter Coset Enumeration Algorithm

Proceedings of the Edinburgh Mathematical Society
Mathematics
1976English

R-Evo: A Reactive Evolutionary Algorithm for the Maximum Clique Problem

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2011English

The Issues of Franchise Agreement Implementation

Bulletin of the Moscow State Regional University (Jurisprudence)
2018English

Issues in Marketing Strategy Implementation

International Business Research
2016English

A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem

Optimization Letters
ControlOptimization
2014English

Implementation of Multisensor Data Fusion Algorithm

International Journal of Sensors and Sensor Networks
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy