关于唯一独立赋权图
On Unique Independence Weighted Graphs
摘要:
图G中的一个独立集是指没有两个顶点由边连接的顶点集。顶点加权图将权重与图中的每个顶点相关联。一个点赋权图G称为唯一独立点赋权图,如果它有唯一的权和最大的独立集.虽然,在本文中,我们观察到,识别唯一独立顶点加权图的问题是NP-困难的一般,因此没有有效的表征,可以预期在一般情况下,我们给,但是,一些组合特征的唯一独立顶点加权图。本文介绍了一个激励应用这个问题的组合拍卖领域,以及。
英文摘要:
An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence vertex-weighted graph if it has a unique independent set with maximum sum of weights. Although, in this paper we observe that the problem of recognizing unique independence vertex-weighted graphs is NP-hard in general and therefore no efficient characterization can be expected in general; we give, however, some combinatorial characterizations of unique independence vertex-weighted graphs. This paper introduces a motivating application of this problem in the area of combinatorial auctions, as well.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。