Amanote Research

Amanote Research

    RegisterSign In

An Improved Bit Parallel Exact Maximum Clique Algorithm

Optimization Letters - Germany
doi 10.1007/s11590-011-0431-y
Full Text
Open PDF
Abstract

Available in full text

Categories
ControlOptimization
Date

December 31, 2011

Authors
Pablo San SegundoFernando MatiaDiego Rodriguez-LosadaMiguel Hernando
Publisher

Springer Science and Business Media LLC


Related search

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

Optimization Letters
ControlOptimization
2014English

An Exact Parallel Algorithm for the Radio K-Coloring Problem

2019English

An Improved QS Algorithm for Pattern Matching of Bit Stream

2016English

A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

International Journal of Computer Applications
2013English

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

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2011English

Exact Algorithms for Dominating Clique Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

An Improved Image Segmentation Algorithm Based on the Maximum Class Variance Method

MATEC Web of Conferences
Materials ScienceEngineeringChemistry
2020English

Approximating Maximum Clique With a Hopfield Network

IEEE Transactions on Neural Networks
1995English

The Power of Pivoting for Exact Clique Counting

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy