Linear programming formulation of the vertex colouring problem Online publication date: Sat, 17-Apr-2010
by Moustapha Diaby
International Journal of Mathematics in Operational Research (IJMOR), Vol. 2, No. 3, 2010
Abstract: In this paper, we present a first linear programming (LP) formulation of the vertex colouring problem (VCP). The complexity orders of the number of variables and the number of constraints of the proposed LP are O (δ9·ς3) and O (δ8·ς3), respectively, where δ and ς are the number of vertices and the number of available colours in the VCP instance, respectively. Hence, the proposed model represents a reaffirmation of 'P = NP'. First, we develop a bipartite network flow (BNF) based model of the problem. Then, we use a graph-based modelling framework similar to that of Diaby to develop the proposed LP model. A numerical example is used to illustrate the approach.
Online publication date: Sat, 17-Apr-2010
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org