A memetic algorithm for finding multiple subgraphs that optimally cover an input network
Sign Up to like & getrecommendations! Published in 2023 at "PLOS ONE"
DOI: 10.1371/journal.pone.0280506
Abstract: Finding dense subgraphs is a central problem in graph mining, with a variety of real-world application domains including biological analysis, financial market evaluation, and sociological surveys. While a series of studies have been devoted to… read more here.
Keywords: input network; cover input; multiple subgraphs; finding multiple ... See more keywords