classical algorithms 1graph algorithms 1graph neural networks 1maximum clique problem 1quantum computing 1
From the 1 of 2 linked papers with an AI index.
1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.AI2026★ 1 cited
A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
Raffaele Marino, Lorenzo Buffoni, Bogdan Zavalnij
The paper surveys algorithms for solving the maximum clique problem, covering classical exact and heuristic methods as well as recent graph neural network and quantum computing app…
math.CO2025
A complete dichotomy theorem on the sparse -Uniform Hypergraphicality Problem
István Miklós, Miklós Ruszinkó, Bogdán Zavalnij
We prove a complete dichotomy theorem for the parameterized sparse -uniform hypergraphic degree sequence problem, $\mathrm{sparse}\text{-}t\text{-}\mathrm{uni}\text{-}\mathrm{HD…