ABSTRACT: The optimal semi-matching problem is one relaxing form of the maximum cardinality matching problems in bipartite graphs, and finds its applications in load balancing. Ordered binary decision ...
This is the repo for GraphComBO, a Bayesian optimization tool for black-box and expensive functions defined over node subsets in graphs, where the goal is to find the optimal subset within a limited ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback