Abstract: Community detection is the problem of identifying natural divisions in networks. A relevant challenge in this problem is to find communities on rapidly evolving graphs. In this paper, we ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback