These algorithms are fixed parameter tractable on the parameter q(G), which is the minimum q such that G is a (q, q − 4)-graph. We also prove that every connected (q, q − 4)-graph with at least q vertices is 2-clique-colorable and that every acyclic coloring of a cograph...
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 some cases to find automated proofs or ideas of proofs. Among other systems, the ...
In this paper, we solve graph theory problems on the LARPBS (linear arrays with reconfigurable pipelined bus system) computing model. (LARPBS was first proposed in [15], [16], and a number of algorithms have been developed on LARPBS [4], [7], [8], [10], [11], [12], [14], [...
A NOTE ON CHROMATICITY OF MULTIBRIDGE GRAPHS Coloring the vertices of graph such that every two adjacent vertices have different colors is a very common problem in graph theory. This is called a prope... A. M. KHALAF - International journal of electronics, communication & instrumentation engineeri...
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...
In this paper we state and explore a connection between graph theory and the theory of recursively defined towers. This leads, among other things, to a gen... P Beelen - 《Journal of Number Theory》 被引量: 29发表: 2004年 Treedecomposition of geometric constraint graphs based on computing...
The remaining sections of this paper are organized as follows: Section “Whale Optimization Algorithm” provides an overview of the basic WOA. Section “Whale Optimization Algorithm based on atom-like structure differential evolution” presents the content of the WOAAD algorithm. Section “Time complexi...
The rest of this paper is divided into sections based on which graph is forbidden. In Section 2 we prove bounds on ex(n,H,kF) for general F, while in Section 3 one of our main results is to determine the order of magnitude of ex(n,Ks,kKt) for all s≥t≥2 and k≥1. In Sect...
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...
Graph layout problems Abstract In this paper we survey the recent results and open questions about some graph layout problems. This research was supported by the ESPRIT BRA Program of the EC under contract no. 7141, project ALCOM-II. Rights and permissions...