Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10859Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Palios, L. | en |
| dc.date.accessioned | 2015-11-24T17:01:02Z | - |
| dc.date.available | 2015-11-24T17:01:02Z | - |
| dc.identifier.issn | 0166-218X | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10859 | - |
| dc.rights | Default Licence | - |
| dc.subject | perfect graphs | en |
| dc.subject | cographs | en |
| dc.subject | cotree | en |
| dc.subject | connected and co-connected components | en |
| dc.subject | parallel algorithms | en |
| dc.subject | parallel recognition | en |
| dc.subject | certifying algorithms | en |
| dc.subject | complement reducible graphs | en |
| dc.subject | p4-sparse graphs | en |
| dc.subject | linear-time | en |
| dc.subject | algorithm | en |
| dc.title | Efficient parallel recognition of cographs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1016/j.dam.2005.02.004 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2005 | - |
| heal.abstract | In this paper, we establish structural properties for the class of complement reducible graphs or cographs, which enable us to describe efficient parallel algorithms for recognizing cographs and for constructing the cotree of a graph if it is a cograph; if the input graph is not a cograph, both algorithms return an induced P-4. For a graph on n vertices and m edges, both our cograph recognition and cotree construction algorithms run in O(log(2) n) time and require O((n + m)l log n) processors on the EREW PRAM model of computation. Our algorithms are motivated by the work of Dahlhaus (Discrete Appl. Math. 57 (1995) 29-44) and take advantage of the optimal O(log n)-time computation of the coconnected components of a general graph (Theory Comput. Systems 37 (2004) 527-546) and of an optimal O(log n)-time parallel algorithm for computing the connected components of a cograph, which we present. Our results improve upon the previously known linear-processor parallel algorithms for the problems (Discrete Appl. Math. 57 (1995) 29-44; J. Algorithms 15 (1993) 284-313): we achieve a better time-processor product using a weaker model of computation and we provide a certificate (an induced P-4 whenever our algorithms decide that the input graphs are not cographs. (c) 2005 Elsevier B.V. All rights reserved. | en |
| heal.journalName | Discrete Applied Mathematics | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nikolopoulos-2005-Efficient parallel r.pdf | 375.3 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
