检索结果-内蒙古大学图书馆

On the hardness of optimization in power-law graphs

THEORETICAL COMPUTER SCIENCE 2008年第1-3期393卷 220-230页

作者： Ferrante, Alessandro Pandurangan, Gopal Park, Kihong Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Univ Salerno Dipartimento Informat & Applicaz RM Capocelli I-84084 Fisciano SA Italy

Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks appear to exhibit a power-law distribution: the number of nodes y(i) of a given degree i is proportional to i(-beta) where beta > 0 is a constant that depends on the application domain. There is practical evidence that combinatorial optimization in power-law graphs is easier than in general graphs, prompting the basic theoretical question: Is combinatorial optimization in power-law graphs easy? Does the answer depend on the power-law exponent beta? Our main result is the proof that many classical NP-hard graph-theoretic optimization problems remain NP-hard on power-law graphs for certain values of beta. In particular, we show that some classical problems, such as CLIQUE and COLORING, remain NP-hard for all beta >= 1. Moreover, we show that all the problems that satisfy the so-called "optimal substructure property" remain NP-hard for all beta >= 0. This includes classical problems such as MINIMUM VERTEX COVER, MAXIMUM INDEPENDENT SET, and MINIMUM DOMINATING SET. Our proofs involve designing efficient algorithms for constructing graphs with prescribed degree sequences that are tractable with respect to various optimization problems. (C) 2007 Elsevier B.V. All rights reserved.

关键词： power-law graphs graph optimization problems NP-hardness graph construction algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：