Código QR (código de barras bidimensional)

An Improved Memetic Algorithm for the Partial Vertex Cover Problem

As a generalized form of the classical minimum vertex cover problem (MVCP), the minimum partial vertex cover problem not only inherits the value of MVCP in both theoretical and practical research but also extends the application scenarios under the current era of big data. In order to solve such a c...

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Principais autores: Yupeng Zhou, Changze Qiu, Yiyuan Wang, Mingjie Fan, Minghao Yin
Format: Artigo
Sprog:Inglês
Udgivet: IEEE 2019-01-01
Serier:IEEE Access
Fag:
Online adgang:https://ieeexplore.ieee.org/document/8631135/
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!