Generating Edge-disjoint Sets of Quadruples in Parallel
نویسندگان
چکیده
Tightening interatomic distance bounds, obtained from NMR experiments, is a critical step in solving the molecular conformation problem. Tetrangle inequality (resulting from the Cayley-Menger determinant for the 3D embedding) is applied to quadruples of atoms in order to tighten the distance bounds. Complete graph Kn is used to model an n-atom molecule, where the nodes represent the atoms. Only edge-disjoint sets of quadruples can be processed in parallel. In this paper we propose a coarse-grain parallelization for generating edge-disjoint sets of quadruples in parallel. Previous methods for generating edge-disjoint quadruples relied on difference sets. Our approach partitions the nodes into disjoint sets (partitions). Quadruples are then generated based on their node distribution among these sets.
منابع مشابه
Edge-disjoint Hamiltonian cycles in two-dimensional torus
The torus is one of the popular topologies for the interconnecting processors to build high-performance multicomputers. This paper presents methods to generate edge-disjoint Hamil-tonian cycles in 2D tori. 1. Introduction. A multicomputer system consists of multiple nodes that communicate by exchanging messages through an interconnection network. At a minimum, each node normally has one or more...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملAn Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs
The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000