A self-stabilizing algorithm is a distributed algorithm that can start from any initial (legitimate or illegitimate) state and eventually converge to a legitimate state in finite time without being assisted by any external agent. In this paper, we propose a selfstabilizing algorithm for finding the 3-edge-connected components of an asynchronous distributed computer network. The algorithm stabil...

Several algorithms exist for decomposing strongly connected components (SCCs). To accommodate recent non-reversible trends in hardware, we focus on utilizing multi-core architectures. Specifically, we consider parallelizing SCC algorithms in the setting of an on-the-fly implementation (to be able to detect SCCs while constructing the graph which is particularly useful for several verification t...

This report presents an adaptive work-efficient approach for implementing the Connected Components algorithm on GPUs. The results show a considerable increase in performance (up to 6.8×) over current state-of-the-art solutions.

Our basic question: Restricting to covers of the sphere by a compact Riemann surface of a given type, do all such compose one connected family? Or failing that, do they fall into easily discerned components? The answer has often been “Yes!,” figuring in the connectedness of the moduli space of curves of genus g (geometry), Davenport’s problem (arithmetic) and the genus 0 problem (group theory)....

Tarjan’s algorihm for finding the strongly connected components of a directed graph is widely used and acclaimed. His original algorithm required at most v(2 + 5w) bits of storage, where w is the machine’s word size, whilst Nuutila and Soisalon-Soininen reduced this to v(1 + 4w). Many real world applications routinely operate on very large graphs where the storage requirements of such algorithm...

A top-down page segmentation technique known as the recursive X-Y cut decomposes a document image recursively into a set of rectanguzar blocks. This paper proposes that the recursive X-Y cut be implemented using bounding bozes of connected components of black pixels instead of using image pizels. The advantage is that great improvement can be achieved in computation. In fact, once bounding boxe...

Cohesive subgraph detection is an important graph problem that is widely applied in many application domains, such as social community detection, network visualization, and network topology analysis. Most of existing cohesive subgraph metrics can guarantee good structural properties but may cause the free-rider effect. Here, by free-rider effect, we mean that some irrelevant subgraphs are combi...

The main result of the present paper is that the projective line over a ring R is connected with respect to the relation ``distant'' if, and only if, R is a GE2-ring. 2000 Mathematics Subject Classi®cation. 51C05, 20H25.

Finding connected components (CC) of an undirected graph is a fundamental computational problem. Various CC algorithms exist for PRAM models. An implementation of a PRAM CC algorithm on a coarse-grain MIMD machine with distributed memory brings many problems, since the communication overhead is substantial compared to the local computation. Several implementations of CC algorithms on distribute...

Mutually connected components (MCCs) play an important role as a measure of resilience in the study of interdependent networks. Despite their importance, an efficient algorithm to obtain the statistics of all MCCs during the removal of links has thus far been absent. Here, using a well-known fully dynamic graph algorithm, we propose an efficient algorithm to accomplish this task. We show that t...