Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10813Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.date.accessioned | 2015-11-24T17:00:47Z | - |
| dc.date.available | 2015-11-24T17:00:47Z | - |
| dc.identifier.issn | 0743-7315 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10813 | - |
| dc.rights | Default Licence | - |
| dc.subject | parallel algorithms | en |
| dc.subject | quasi-threshold graphs | en |
| dc.subject | recognition | en |
| dc.subject | tree representation | en |
| dc.subject | hamiltonian cycles | en |
| dc.subject | hamiltonian completion number | en |
| dc.subject | complexity | en |
| dc.subject | recognition algorithm | en |
| dc.subject | cographs | en |
| dc.title | Parallel algorithms for Hamiltonian problems on quasi-threshold graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1016/j.jpdc.2003.08.004 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2004 | - |
| heal.abstract | In this paper we show structural and algorithmic properties on the class of quasi-threshold graphs, or QT-graphs for short, and prove necessary and sufficient conditions for a QT-graph to be Hamiltonian. Based on these properties and conditions, we construct an efficient parallel algorithm for finding a Hamiltonian cycle in a QT-graph; for an input graph on n vertices and in edges, our algorithm takes O(log n) time and requires O(n + m) processors on the CREW PRAM model. In addition, we show that the problem of recognizing whether a QT-graph is a Hamiltonian graph and the problem of computing the Hamiltonian completion number of a nonHamiltonian QT-graph can also be solved in O(log n) time with O(n + in) processors. Our algorithms rely on O(log n)-time parallel algorithms, which we develop here, for constructing tree representations of a QT-graph; we show that a QT-graph G has a unique tree representation, that is, a tree structure which meets the structural properties of G. We also present parallel algorithms for other optimization problems on QT-graphs which run in O(log n) time using a linear number of processors. (C) 2003 Elsevier Inc. All rights reserved. | en |
| heal.journalName | Journal of Parallel and Distributed Computing | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nikolopoulos-2004-Parallel algorithms.pdf | 551.61 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
