Parallel computation | Guide books skip to main content ACM Digital Library home ACM home
Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …

Graph parameters such as connectivity and diameter have been studied extensively due to
their intrinsic importance in graph theory, combinatorics and their relations to (and …

Suppose that G is a bipartite graph with its partite sets of equal size. G is said to be strongly
Hamiltonian‐laceable if there is a Hamiltonian path between every two vertices that belong …

Data communication and fault tolerance are important issues in parallel computers in which
the processors are interconnected according to a specific topology. One way to achieve fault …

Given a node s and a set T= t1,…, tk of k nodes in a k-connected graph, the node-to-set
disjoint paths problem is to find k node-disjoint paths pi: s→ ti, 1⩽ i⩽ k. In this paper, we give …

Motivated by parallel routing in networks with faults, we study the following graph theoretical
problem. Let G be a graph of minimum vertex degree d. We say that G is strongly Menger …

Star networks were proposed recently as an attractive alternative to the well-known
hypercube models for interconnection networks. Extensive research has been performed …

This paper is a review of sorting on several well-known graphs by adjacent swaps using
permutation groups. Given a graph with a line, star, complete, or ring topology having n …

Routing functions had been shown effective in constructing node-disjoint paths in hypercube-
like networks. In this paper, by the aid of routing functions, m node-disjoint shortest paths …

We present a local clocking mechanism based on a tunable delay line which calibrates itself
from a low frequency global clock. After initial tuning, the local clock remains calibrated …