Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11100Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, Stavros D. | en |
| dc.date.accessioned | 2015-11-24T17:02:51Z | - |
| dc.date.available | 2015-11-24T17:02:51Z | - |
| dc.identifier.issn | 1063-7192 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11100 | - |
| dc.rights | Default Licence | - |
| dc.title | PARALLEL BLOCK-FINDING USING DISTANCE MATRICES | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | 10.1080/10637199608915561 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 1996 | - |
| heal.abstract | We present a fast parallel algorithm for finding the blocks or biconnected components of an undirected graph G = (V,E ) having n vertices and m edges. Our techniques arc based on partitioning the vertex set V into adjacency-level sets using information contained in the distance matrix D of the graph. Let t D and p D be the time and number of processors, respectively, for the computation of the distance matrix of a graph G on a CRCW-PRAM computational model. We show that the location of all cut vertices and bridges of a graph can be done in time O(logδ + t D) by using O(n m/t d) processors, where δ is the maximum degree of a vertex in G. Based on these results, we define a digraph G d and we prove certain properties on its distance matrix leading to a parallel block-finding algorithm running in time O(logδ + t D) with O(n m/t D) processors on the same computational model. We also show that other connectivity-related problems can be efficiently solved using distance matrices. | en |
| heal.publisher | Taylor & Francis | en |
| heal.journalName | Parallel Algorithms and Applications | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nikolopoulos-1996-PARALLEL BLOCK-FINDING USING DISTANCE MATRICES.pdf | 307.37 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
