Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10818Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, Stavros D. | en |
| dc.contributor.author | Palios, Leonidas | en |
| dc.date.accessioned | 2015-11-24T17:00:48Z | - |
| dc.date.available | 2015-11-24T17:00:48Z | - |
| dc.identifier.issn | 1571-0653 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10818 | - |
| dc.rights | Default Licence | - |
| dc.title | On the Strongly Connected and Biconnected Components of the Complement of Graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | 10.1016/j.endm.2004.03.044 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2004 | - |
| heal.abstract | In this paper, we consider the problems of computing the strongly connected components and the biconnected components of the complement of a given graph. In particular, for a directed graph G on n vertices and m edges, we present a simple algorithm for computing the strongly connected components of G ? which runs in optimal O ( n + m ) time. The algorithm can be parallelized to yield an O ( log 2 n ) -time and O ( m 1.188 / log n ) -processor solution. As a byproduct, we obtain a very simple optimal parallel co-connectivity algorithm. Additionally, we establish properties which, for an undirected graph on n vertices and m edges, enable us to describe an O ( n + m ) -time algorithm for computing the biconnected components of G ? , which can be parallelized resulting in an algorithm that runs in O ( log n ) time using O ( ( n + m ) / log n ) processors. | en |
| heal.journalName | Electronic Notes in Discrete Mathematics | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| palios-2004-On the Strongly Connected and Biconnected Components of the Complement of Graphs.pdf | 172.2 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
