Abstract: 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 assign ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback