More recently, methods of operations research and artificial intelligence have been used to advance graph theory per se, i.e., to find conjectures on graph theory invariants, to refute such conjectures and in s
Letbe a distance-regular graph of diameter 3 with strong regular graph. The determination of the parametersΓ3over the intersection array of the graphΓis a direct problem. Finding an intersection array of the graphΓwith respect to the parametersΓ3is an inverse problem. Previously, inverse pr...
10.1.1.234.2288 On some extremal problems in graph theory (2008) by Dmitry Jakobson , Igor Rivin [图论中的某些极值问题] 热度: Zwiebach B. - A First Course in String Theory. Solutions to problems, part 1(T)(143s) (1970) 热度: 视译 口译 Sight translation as a topic in ...
Like past QAOA experiments, we study performance for problems defined on the planar connectivity graph native to our hardware; however, we also apply the QAOA to the Sherrington–Kirkpatrick model and MaxCut, non-native problems that require extensive compilation to implement. For hardware-native ...
In the context of Graph Theory, the discrete Laplacian is no more than a matrix. Hence, it can be considered as a kernel on the vertex set and therefore it is possible to build a Potential Theory with respect to such a kernel. This point of view will take validity as the Laplacian ker...
The first known result in extremal graph theory is Mantel’s Theorem, [18], which states that the maximum number of edges in a triangle-free graph on n vertices is realized by the balanced complete bipartite graph K⌈n∕2⌉,⌊n∕2⌋. This was later generalized to graphs that conta...
The adaptation of the academic job shop scheduling model to industrial practice is well known to be rich of difficulties owing to the gap between scheduling theory and practice. On the other hand, several authors observed that the disjunctive graph formulation of Roy and Sussman was more robust ...
The learning with errors (LWE) problem is a problem derived from machine learning that is believed to be intractable for quantum computers. This paper proposes a method that can reduce an LWE problem to a set of maximum independent set (MIS) problems, which are graph problems that are suitabl...
We solve a number of important and interesting problems from graph theory on a linear array with a reconfigurable pipelined optical bus system. Our algorithms are based on fast matrix multiplication and extreme value finding algorithms, and are currently the fastest algorithms. We also distinguish the...
Our algorithms are based on classical results in algorithmic graph theory and new structural properties ofD-DI graphs that may be of independent interest. Preview Unable to display preview.Download preview PDF. Similar content being viewed by others ...