Statistical mechanics of the minimum vertex cover problem in stochastic block models.
Sign Up to like & getrecommendations! Published in 2019 at "Physical review. E"
DOI: 10.1103/physreve.100.062101
Abstract: The minimum vertex cover (Min-VC) problem is a well-known NP-hard problem. Earlier studies illustrate that the problem defined over the Erdös-Rényi random graph with a mean degree c exhibits computational difficulty in searching the Min-VC… read more here.
Keywords: problem; minimum vertex; vertex cover; stochastic block ... See more keywords
MEAMVC: A Membrane Evolutionary Algorithm for Solving Minimum Vertex Cover Problem
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2915550
Abstract: Since the membrane algorithm was proposed, it has been used for many optimization problems such as, traveling salesman problem, the knapsack problem, and so on. In membrane algorithms, the membranes have two functions: container and… read more here.
Keywords: problem; membrane; algorithm; minimum vertex ... See more keywords