Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10914Full 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:22Z | - |
| dc.date.available | 2015-11-24T17:01:22Z | - |
| dc.identifier.issn | 1365-8050 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10914 | - |
| dc.rights | Default Licence | - |
| dc.subject | hh-free graph | en |
| dc.subject | hhd-free graph | en |
| dc.subject | welsh-powell opposition graph | en |
| dc.subject | perfectly orderable graph | en |
| dc.subject | recognition | en |
| dc.subject | perfectly orderable graphs | en |
| dc.subject | complexity | en |
| dc.title | Recognizing HH-free, HHD-free, and Welsh-Powell opposition 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 | 2006 | - |
| heal.abstract | In this paper, we consider the recognition problem on three classes of perfect graphs, namely, the HH-free, the HHD-free, and the Welsh-Powell opposition graphs (or WPO-graphs). In particular, we prove properties of the chordal completion of a graph and show that a modified version of the classic linear-time algorithm for testing for a perfect elimination ordering can be efficiently used to determine in O(n min{m alpha(n,n), m + n log n}) time whether a given graph G on n vertices and m edges contains a house or a hole; this implies an O( n min{m alpha(n, n), m + n log n})-time and O( n + m)-space algorithm for recognizing HH-free graphs, and in turn leads to an HHD-free graph recognition algorithm exhibiting the same time and space complexity. We also show that determining whether the complement (G) over bar of the graph G is HH-free can be efficiently resolved in O(nm) time using O(n(2)) space, which leads to an O(nm)-time and O(n(2))-space algorithm for recognizing WPO-graphs. The previously best algorithms for recognizing HH-free, HHD-free, and WPO-graphs required O(n(3)) time and O(n(2)) space. | en |
| heal.journalName | Discrete Mathematics and Theoretical Computer Science | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| palios-2006-Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs.pdf | 296.96 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
