An optimal parallel co-connectivity algorithm (EN)

Chong, K. W. (EN)

Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής (EL)

Chong, K. W. (EN)

In this paper we consider the problem of computing the connected components of the complement of a given graph. We describe a simple sequential algorithm for this problem, which works on the input graph and not on its complement, and which for a graph on n vertices and m edges runs in optimal O(n+m) time. Moreover, unlike previous linear co-connectivity algorithms, this algorithm admits efficient parallelization, leading to an optimal O(logn)-time and O((n+m)/log n)-processor algorithm on the EREW PRAM model of computation. It is worth noting that, for the related problem of computing the connected components of a graph, no optimal deterministic parallel algorithm is currently available. The co-connectivity algorithms find applications in a number of problems. In fact, we also include a parallel recognition algorithm for weakly triangulated graphs, which takes advantage of the parallel co-connectivity algorithm and achieves an O(log(2)n) time complexity using O((n+m(2))/log n) processors on the EREW PRAM model of computation. (EN)

weakly triangulated graphs (EN)

Πανεπιστήμιο Ιωαννίνων

Ιδρυματικό Αποθετήριο Ολυμπιάς

Σχολή Θετικών Επιστημών

ΑΠΟΘΕΤΗΡΙΟ "ΟΛΥΜΠΙΑΣ"

Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής

Theory of Computing Systems (EN)

Αγγλική γλώσσα

2004

http://olympias.lib.uoi.gr/jspui/handle/123456789/10790