Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/11000Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, Stavros D. | en |
| dc.date.accessioned | 2015-11-24T17:01:56Z | - |
| dc.date.available | 2015-11-24T17:01:56Z | - |
| dc.identifier.issn | 0020-0190 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/11000 | - |
| dc.rights | Default Licence | - |
| dc.subject | Parallel algorithms | en |
| dc.subject | Perfect graphs | en |
| dc.subject | Split graphs | en |
| dc.subject | Parallel recognition | en |
| dc.title | Constant-time parallel recognition of split graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | 10.1016/0020-0190(94)00233-o | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 1995 | - |
| heal.abstract | We show that the class of perfect graphs known as split graphs can be efficiently recognized in a parallel process environment. Given an undirected graph G = (V, E) with n vertices we define a subgraph Ga = (AV, AE) and we prove some properties on Ga leading to a constant-time parallel split graph recognition algorithm. | en |
| heal.journalName | Information Processing Letters | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nikolopoulos-1995-Constant-timeparallelrecognition of splitgraphs.pdf | 738.16 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
