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.
from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2qHmQlh
via IFTTT
Εγγραφή σε:
Σχόλια ανάρτησης (Atom)
Δημοφιλείς αναρτήσεις
-
Publication date: Available online 4 January 2018 Source: European Journal of Radiology Author(s): Peiyao Zhang, Jing Wang, Qin Xu, Zhen...
-
Medicine by Alexandros G. Sfakianakis,Anapafseos 5 Agios Nikolaos 72100 Crete Greece,00302841026182, Butyric Acid from Probiotic Staphyloco...
-
Does CBD Oil Lower Blood Pressure? This article was originally published at SundayScaries." Madeline Taylor POSTED ON January 13, 20...
-
Medicine by Alexandros G. Sfakianakis,Αλέξανδρος Γ. Σφακιανάκης A Novel Technique for Endoscopic Repair of Large Anterior Skull Base Defect...
-
2016-11-22T07-55-59Z Source: International Journal of Medical Science and Public Health Banothu Srinivas, Madhu Mohan Reddy B. Backgrou...
-
2016-10-15T06-30-01Z Source: The Southeast Asian Journal of Case Report and Review Sangita Deepak Kamath, Neeraj Jain, Saurabh Pathak, Ba...
-
BACKGROUND AND PURPOSE: Lesion load is a common biomarker in multiple sclerosis, yet it has historically shown modest association with cl...
-
Abstract The development of focused ion beam-scanning electron microscopy (FIB-SEM) techniques has allowed high-resolution 3D imaging of n...
-
Vol.48 No.2 from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/1S2Z7n2 via IFTTT
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου