检索结果-南通市图书馆

Vertex Cover Optimization Using a Novel Graph Decomposition Approach

Computers, Materials & Continua 2022年第10期73卷 701-717页

作者： Abdul Manan Shahida Bashir Abdul Majid Department of Mathematics University of GujratGujrat50700Pakistan Department of Physics University of GujratGujrat50700Pakistan

The minimum vertex cover problem(MVCP)is a well-known combinatorial optimization problem of graph *** MVCP is an NP(nondeterministic polynomial)complete problem and it has an exponential growing complexity with respect to the size of a *** algorithm exits till date that can exactly solve the problem in a deterministic polynomial time ***,several algorithms are proposed that solve the problem approximately in a short polynomial time *** algorithms are useful for large size graphs,for which exact solution of MVCP is impossible with current computational *** MVCP has a wide range of applications in the fields like bioinformatics,biochemistry,circuit design,electrical engineering,data aggregation,networking,internet traffic monitoring,pattern recognition,marketing and franchising *** work aims to solve the MVCP approximately by a novel graph decomposition *** decomposition of the graph yields a subgraph that contains edges shared by triangular edge structures.A subgraph is covered to yield a subgraph that forms one or more Hamiltonian cycles or *** order to reduce complexity of the algorithm a new strategy is also *** reduction strategy can be used for any algorithm solving *** on the graph decomposition and the reduction strategy,two algorithms are formulated to approximately solve the *** algorithms are tested using well known standard benchmark *** key feature of the results is a good approximate error ratio and improvement in optimum vertex cover values for few graphs.

关键词： Combinatorial optimization graph theory minimum vertex cover problem maximum independent set maximum degree greedy approach approximation algorithms benchmark instances

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：