A memetic algorithm for finding multiple subgraphs that optimally cover an input network

• Xiaochen He,

  Roles Writing – original draft

  Affiliation Center for Administration and Complexity Science of Xi’an Jiaotong University, Xi’an, Shaanxi Province, China

  ⨯
• Yang Wang,

  Roles Methodology, Writing – review & editing

  Affiliation Center for Administration and Complexity Science of Xi’an Jiaotong University, Xi’an, Shaanxi Province, China

  https://orcid.org/0000-0002-0092-927X

  ⨯
• Haifeng Du ,

  Roles Conceptualization, Writing – review & editing

  * E-mail: haifengdu@mail.xjtu.edu.cn (HD); mfeldman@stanford.edu (MWF)

  Affiliation Center for Administration and Complexity Science of Xi’an Jiaotong University, Xi’an, Shaanxi Province, China

  ⨯
• Marcus W. Feldman

  Roles Supervision, Writing – review & editing

  * E-mail: haifengdu@mail.xjtu.edu.cn (HD); mfeldman@stanford.edu (MWF)

  Affiliation Morrison Institute for Population and Resource Studies, Stanford University, Stanford, CA, United States of America

  https://orcid.org/0000-0002-0664-3803

  ⨯