Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10817Full 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:00:48Z | - |
| dc.date.available | 2015-11-24T17:00:48Z | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10817 | - |
| dc.rights | Default Licence | - |
| dc.subject | perfectly orderable graphs | en |
| dc.subject | complexity | en |
| dc.title | Recognizing 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 | 2004 | - |
| heal.abstract | In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, 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 " modified version of the classic linear-time algorithm for testing for " perfect elimination ordering can be efficiently used to determine in O(min{nmalpha(n), nm + n(2) log n}) time whether a given graph G on n vertices and m edges contains a house or a hole; this leads to an O(min{nmalpha(n), nm+n(2) log n})-time and O(n+m)-space algorithm for recognizing HHD-free graphs. We also show that determining whether the complement (G) over bar of the graph G contains a house or a hole can be efficiently resolved in O(nm) time using O(n(2)) space, this in turn leads to an O(nm)-time and O(n(2))-space algorithm for recognizing WPO-graphs. The previously best algorithms for recognizing HHD-free and WPO-graphs required O(n(3)) time and O(n(2)) space. | en |
| heal.journalName | Graph -Theoretic Concepts in Computer Science | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
There are no files associated with this item.
This item is licensed under a Creative Commons License
