文件名称:Ostergard_A-New-Algorithm-for-the-Maximum-Weight-
-
所属分类：
- 标签属性：
- 上传时间：2012-11-16
-
文件大小：59kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
Given a graph, in the maximum clique problem one wants to find the largest number
of vertices any two of which are adjacent. In the maximum-weight clique problem,
the vertices have weights, and one wants to find a clique with maximum weight. A
recently developed algorithm for the maximum clique problem is here transformed
into an algorithm for the weighted case. Computational experiments with random
graphs show that this new algorithm in many cases is faster than earlier algorithms.
of vertices any two of which are adjacent. In the maximum-weight clique problem,
the vertices have weights, and one wants to find a clique with maximum weight. A
recently developed algorithm for the maximum clique problem is here transformed
into an algorithm for the weighted case. Computational experiments with random
graphs show that this new algorithm in many cases is faster than earlier algorithms.
相关搜索： clique
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Ostergard_A New Algorithm for the Maximum-Weight Clique Problem.pdf
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。