Parallel algorithms for switching edges in heterogeneous graphs
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Series Parallel Graphs
In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...
متن کاملGeometric graphs with no two parallel edges
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges is at most 2n− 2. We also give a strengthening of this result in the case where G does not contain a cycle of length 4. In the latter case we show that G has at most 3 2 (n − 1) edges.
متن کاملParallel Heterogeneous Genetic Algorithms for Continuous Optimization
In this paper we address the physical parallelization of a very efficient genetic algorithm (GA) known as gradual distributed real-coded GA (GD-RCGA). This search model naturally provides a set of eight subpopulations residing in a cube topology having two faces for promoting exploration and exploitation. The resulting technique has been shown to yield very accurate results in continuous optimi...
متن کاملNew strongly regular graphs from switching of edges
By Seidel’s switching, we construct new strongly regular graphs with parameters (276, 140, 58, 84). In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let G = (V,E) be a primitive strongly regular graph with parameters (v, k, λ, μ). Let S(G,H) be the graph from G by switching with respect to a nonempty H ⊂ V . Suppose v = 2(k − θ1) where θ1 is the nont...
متن کاملParallel algorithms for P4-comparability graphs
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P4-comparability graph and the problem of producing an acyclic P4-transitive orientation of such a graph. Sequential algorithms for these problems have been presented by Hoàng and Reed and very recently by Raschle and Simon, and by Nikolopoulos and Palios. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2017
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2016.12.005