A Short Review on Novel Approaches for Maximum Clique Problem: from Classical algorithms to Graph Neural Networks and Quantum algorithms
This manuscript provides a comprehensive review of the Maximum Clique Problem, a
computational problem that involves finding subsets of vertices in a graph that are all …
computational problem that involves finding subsets of vertices in a graph that are all …
[HTML][HTML] CliSAT: A new exact algorithm for hard maximum clique problems
Given a graph, the maximum clique problem (MCP) asks for determining a complete
subgraph with the largest possible number of vertices. We propose a new exact algorithm …
subgraph with the largest possible number of vertices. We propose a new exact algorithm …
A different approach to maximum clique search
S Szabó, B Zavalnij - … on Symbolic and Numeric Algorithms for …, 2018 - ieeexplore.ieee.org
The way we tackle NP-hard problems in practical setting has experienced a major shift in
recent years. Our view has became more sophisticated with the emergence of the …
recent years. Our view has became more sophisticated with the emergence of the …
Quantum computing and the stable set problem
A Krpan, J Povh, D Pucher - arXiv preprint arXiv:2405.12845, 2024 - arxiv.org
Given an undirected graph, the stable set problem asks to determine the cardinality of the
largest subset of pairwise non-adjacent vertices. This value is called the stability number of …
largest subset of pairwise non-adjacent vertices. This value is called the stability number of …
A Class of New Cutting Planes for SDP Relaxations of Stable Set and Coloring Problems
D Pucher, F Rendl - arXiv preprint arXiv:2401.17069, 2024 - arxiv.org
We propose a class of new cutting planes to strengthen the Lov\'asz theta function, a well-
known semidefinite programming (SDP) relaxation for the stable set and the graph coloring …
known semidefinite programming (SDP) relaxation for the stable set and the graph coloring …
[HTML][HTML] Decomposing clique search problems into smaller instances based on node and edge colorings
S Szabó, B Zavalnij - Discrete Applied Mathematics, 2018 - Elsevier
To carry out a clique search in a given graph in a parallel fashion, one divides the problem
into a very large number of smaller instances. To sort out as many resulted smaller problems …
into a very large number of smaller instances. To sort out as many resulted smaller problems …
Ultrascale Computing Systems
B Matter - IET
[6] Sousa L, Kropf P, Kuonene P, et al. A roadmap for research in sustainable ultrascale
systems. University Carlos III of Madrid; 2017. Available from: https://www. irit. fr/∼ Georges …
systems. University Carlos III of Madrid; 2017. Available from: https://www. irit. fr/∼ Georges …
The k-Clique Problem Usage, Modeling Expressivity, Serial and Massively Parallel Algorithms
B Zaválnij - 2020 - search.proquest.com
Our thesis work is focused on discrete optimization problems, and specifically on problems
represented by graphs. These problems emerge in various applications, and form an …
represented by graphs. These problems emerge in various applications, and form an …
[PDF][PDF] CliSAT: a SAT-based exact algorithm for hard maximum clique problems
Given a graph, the maximum clique problem (MCP) asks for determining a complete
subgraph with the largest possible number of vertices. We propose a new exact algorithm …
subgraph with the largest possible number of vertices. We propose a new exact algorithm …
Alternative Branching Strategies in the Branch and Bound Algorithm by Using a k-clique covering vertex set for Maximum Clique Problems.
M Suyudi, AK Supriatna… - International Journal of …, 2020 - journal.rescollacomm.com
The Maximum clique problem (MCP) is graph theory problem that demand complete subgraf
with maximum cardinality (maximum clique) in arbitrary graph. Solving MCP usually use …
with maximum cardinality (maximum clique) in arbitrary graph. Solving MCP usually use …