1 citations · 1 across the 2 of their papers we have counts for
2 papers
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…
cs.AI2024★ 1 cited
A short review on the maximum clique problem algorithms with classical, AI, and quantum methods
Raffaele Marino, Lorenzo Buffoni, Bogdan Zavalnij
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 pairwise ad…