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)
Δημοφιλείς αναρτήσεις
-
Objectives To optimise medical students’ early clerkship is a complex task since it is conducted in a context primarily organised to take ca...
-
Abstract Purpose Overcoming the flaws of current data management conditions in head and neck oncology could enable integrated informatio...
-
1 abqls-210rm.html Read the latest Journal of Clinical Neurophysiology - Vol. 37, No. 1, January 2020.eml 2 agx3v-nxz96.html Read the late...
-
Cone-beam CT (CBCT) is a widely used intra-operative imaging modality in image-guided radiotherapy and surgery. A short scan followed by a f...
-
by Yanwei Li, Haifeng Liu, Wei Zeng, Jing Wei An increase in the osmolarity of tears induced by excessive evaporation of the aqueous tear p...
-
http://ift.tt/2p41efZ
-
-
Small size of metastatic lymph nodes with extracapsular spread greatly impacts treatment outcomes in oral squamous cell carcinoma patie...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου