7 citations · 14 across the 17 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2025★ 1 cited
Faster Vertex Cover Algorithms on GPUs with Component-Aware Parallel Branching
Hussein Amro, Basel Fakhri, Amer E. Mouawad +1
Algorithms for finding minimum or bounded vertex covers in graphs use a branch-and-reduce strategy, which involves exploring a highly imbalanced search tree. Prior GPU solutions as…
cs.DC2022
Parallel Vertex Cover Algorithms on GPUs
Peter Yamout, Karim Barada, Adnan Jaljuli +2
Finding small vertex covers in a graph has applications in numerous domains. Two common formulations of the problem include: Minimum Vertex Cover, which finds the smallest vertex c…