Maximum Clique Exhaustive Search in Circulant k-Hypergraphs

2019 ◽  
pp. 378-392 ◽  
Author(s):  
Lachlan Plant ◽  
Lucia Moura
Keyword(s):  
Maximum Clique ◽  
Exhaustive Search

1P285 Exhaustive search for protein surface similarities using a grid computing system

2005 ◽  
Vol 45 (supplement) ◽  
pp. S103
Author(s):  
R. Minai ◽  
M. Iwasaki ◽  
H. Murakmai ◽  
Y. Matsuo
Keyword(s):  
Grid Computing ◽  
Computing System ◽  
Exhaustive Search ◽  
Protein Surface

scholarly journals Using Machine Learning for Quantum Annealing Accuracy Prediction

Algorithms ◽  
2021 ◽  
Vol 14 (6) ◽  
pp. 187
Author(s):  
Aaron Barbosa ◽  
Elijah Pelofske ◽  
Georg Hahn ◽  
Hristo N. Djidjev
Keyword(s):  
Machine Learning ◽  
Maximum Clique ◽  
Classification Model ◽  
Maximum Clique Problem ◽  
Problem Instance ◽  
Np Hard ◽  
Machine Learning Classification ◽  
Hard Problems ◽  
Problem Instances ◽  
D Wave

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the maximum clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters, such as the D-Wave’s chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.

Artifact of Bounded Exhaustive Search of Alloy Specification Repairs

2021 ◽  
Author(s):  
Simon Gutierrez Brida ◽  
German Regis ◽  
Guolong Zheng ◽  
Hamid Bagheri ◽  
ThanhVu Nguyen ◽  
...  
Keyword(s):  
Exhaustive Search

scholarly journals EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs

2021 ◽  
Vol 68 (2) ◽  
pp. 1-38
Author(s):  
Marthe Bonamy ◽  
Édouard Bonnet ◽  
Nicolas Bousquet ◽  
Pierre Charbit ◽  
Panos Giannopoulos ◽  
...  
Keyword(s):  
Unit Ball ◽  
Maximum Clique ◽  
Subexponential Algorithm

scholarly journals Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata

2015 ◽  
Vol 23 (01) ◽  
pp. 1-31 ◽  
Author(s):  
Alireza Rezvanian ◽  
Mohammad Reza Meybodi
Keyword(s):  
Community Structure ◽  
Dominating Set ◽  
Learning Automata ◽  
Random Variables ◽  
Graph Model ◽  
Maximum Clique ◽  
Distribution Functions ◽  
Maximum Clique Problem ◽  
Stochastic Graphs ◽  
Stochastic Graph

Because of unpredictable, uncertain and time-varying nature of real networks it seems that stochastic graphs, in which weights associated to the edges are random variables, may be a better candidate as a graph model for real world networks. Once the graph model is chosen to be a stochastic graph, every feature of the graph such as path, clique, spanning tree and dominating set, to mention a few, should be treated as a stochastic feature. For example, choosing stochastic graph as the graph model of an online social network and defining community structure in terms of clique, and the associations among the individuals within the community as random variables, the concept of stochastic clique may be used to study community structure properties. In this paper maximum clique in stochastic graph is first defined and then several learning automata-based algorithms are proposed for solving maximum clique problem in stochastic graph where the probability distribution functions of the weights associated with the edges of the graph are unknown. It is shown that by a proper choice of the parameters of the proposed algorithms, one can make the probability of finding maximum clique in stochastic graph as close to unity as possible. Experimental results show that the proposed algorithms significantly reduce the number of samples needed to be taken from the edges of the stochastic graph as compared to the number of samples needed by standard sampling method at a given confidence level.

Sign in / Sign up

Export Citation Format

Share Document