A variable neighborhood search approach for the vertex bisection problem.
Information Sciences(2019)
摘要
The Vertex Bisection Problem (VBP) belongs to the family of well-known graph partitioning problems, where the main goal is to find a partition of the vertices maximizing or minimizing a given objective function. These optimization problems have relevant application in the context of scientific computing, VLSI design circuit, or task scheduling in multi-processor systems. This family of problems has gained importance due to its application in clustering and detection of cliques in social, pathological, and biological networks.
更多查看译文
关键词
Metaheuristics,Variable neighborhood search,Vertex bisection,Graph problems
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络