Cargando…
A memetic algorithm for finding multiple subgraphs that optimally cover an input network
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 finding subgraphs with maximum density, the problem of f...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9858781/ https://www.ncbi.nlm.nih.gov/pubmed/36662749 http://dx.doi.org/10.1371/journal.pone.0280506 |