Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation

A. Suebsriwichai and T. Mouktonglang

Journal of Applied Mathematics, 2017, vol. 2017, 1-7

Abstract:

The crossing number of graph is the minimum number of edges crossing in any drawing of in a plane. In this paper we describe a method of finding the bound of 2-page fixed linear crossing number of . We consider a conflict graph of . Then, instead of minimizing the crossing number of , we show that it is equivalent to maximize the weight of a cut of . We formulate the original problem into the MAXCUT problem. We consider a semidefinite relaxation of the MAXCUT problem. An example of a case where is hypercube is explicitly shown to obtain an upper bound. The numerical results confirm the effectiveness of the approximation.

Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/JAM/2017/7640347.pdf (application/pdf)
http://downloads.hindawi.com/journals/JAM/2017/7640347.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:7640347

DOI: 10.1155/2017/7640347

Access Statistics for this article

More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().