Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11011Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Danielopoulos, S. D. | en |
| dc.date.accessioned | 2015-11-24T17:02:06Z | - |
| dc.date.available | 2015-11-24T17:02:06Z | - |
| dc.identifier.issn | 0898-1221 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11011 | - |
| dc.rights | Default Licence | - |
| dc.subject | parallel algorithm | en |
| dc.subject | perfect elimination | en |
| dc.subject | graph partition | en |
| dc.subject | lexicographic search | en |
| dc.subject | triangulated graph | en |
| dc.subject | crcw-pram | en |
| dc.subject | complexity | en |
| dc.subject | access | en |
| dc.title | Parallel Computation of Perfect Elimination Schemes Using Partition Techniques on Triangulated Graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 1995 | - |
| heal.abstract | Perfect elimination schemes (p.e.s.) occur in a number of important problems such as perfect Gaussian elimination. The main objective of this paper is to study the parallel computation of p.e.s, of a triangulated or perfect elimination graph G = (V, E), with n = /V/ vertices. We start with the notion of partitioning a triangulated graph into a set of (mutually disjoint) adjacency-level sets and we present a parallel algorithm, based mainly on the properties of the adjacency-level sets, which computes a p.e.s. in time O(log L . log H) using L . H . n(2) processors on a CRCW-PRAM. The computation of the adjacency-level sets of a triangulated graph can be done in time O(log L) with L . H . n(2) processors within the same type of computational model. Here, L < n and H < n are the length and the height of the graph, respectively. | en |
| heal.journalName | Computers & Mathematics with Applications | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nikolopoulos-1995-Parallel Computation of Perfect Elimination Schemes Using Partition Techniques on Triangulated Graphs.pdf | 721.84 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
