...
首页> 外文期刊>Discrete Applied Mathematics >The weighted independent domination problem is NP-complete for chordal graphs
【24h】

The weighted independent domination problem is NP-complete for chordal graphs

机译:弦图的加权独立控制问题是NP完全的

获取原文
获取原文并翻译 | 示例
           

摘要

An independent dominating set of a graph G = (VE) is a pairwise non-adjacent subset D of V such that every vertex not in D is adjacent to at least one vertex in D. Suppose each vertex in V is associated with a weight which is a real number. The weighted independent domination problem is to find an independent domination set of minimum total weights. This paper records an unpublished result of 20 years ago that the weighted independent domination problem is NP-complete for chordal graphs. (C) 2003 Elsevier B.V. All rights reserved.
机译:图G =(VE)的一个独立的支配集合是V的成对的非相邻子集D,使得不在D中的每个顶点都与D中的至少一个顶点相邻。假设V中的每个顶点都与一个权重相关联是一个实数。加权独立支配问题是找到最小总权重的独立支配集。本文记录了20年前未发表的结果,即弦图的加权独立控制问题是NP-完全的。 (C)2003 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号