Abstract: The minimum dominant set problem in graphs is a well-known NP-hard problem that requires the use of heuristics to obtain approximate solutions due to its computational complexity. Among the ...
Abstract: The Edmonds Blossom algorithm is implemented here using depth-first search, which is intrinsically serial. By streamlining the code, our serial implementation is consistently three to five ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback