Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10790Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chong, K. W. | en |
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Palios, L. | en |
| dc.date.accessioned | 2015-11-24T17:00:36Z | - |
| dc.date.available | 2015-11-24T17:00:36Z | - |
| dc.identifier.issn | 1432-4350 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10790 | - |
| dc.rights | Default Licence | - |
| dc.subject | weakly triangulated graphs | en |
| dc.subject | efficient | en |
| dc.subject | components | en |
| dc.title | An optimal parallel co-connectivity algorithm | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1007/s00224-003-1074-x | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2004 | - |
| heal.abstract | 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 |
| heal.journalName | Theory of Computing Systems | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Chong-2004-An optimal parallel.pdf | 305.25 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
