Integer Programming Model for Maximum Clique in Graph

来源 :中国矿业大学学报(英文版) | 被引量 : 0次 | 上传用户:dailynice
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
The maximum clique or maximum independent set of graph is a classical problem in graph theory. Combined with Boolean algebra and integer programming, two integer programming models for maximum clique problem,which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by several examples.
其他文献
According to the data of main environmental factors and the depth of localized corrosion of carbon steel and low alloy steels in China seas, combined with the r
The effects of the incorporated oxygen and the different buffer layers on the optical properties and surface morphology of GaN were studied. The results show th
Consistency of LS estimate of simple linear EV model is studied. It is shown that under some common assumptions of the model, both weak and strong consistency o
An f-edge cover-colouring of a graph G = (V, E) is an assignment of colours to the edges of G such that every colour appears at each vertex υ∈ V at least f(υ
Aluminum coatings were created onto glass beads by chemical vapor deposition in a fluidized bed reactor at different temperatures. Nitrogen was enriched with Tr
The title compound (C25H17BrClN3) has been synthesized by the reaction of 1-(2- chlorophenyl)-3-(4-bromophenyl)-2-propylene-1-one with 5-amino-3-methyl-1-phenyl
Most previous land-surface model calibration studies have defined global ranges for their parameters to search for optimal parameter sets. Little work has been
AIM: To develop a simplified and efficient method for the preparation of hepatitis C virus (HCV) cDNA microarray probes.METHODS: With the technique of restricti