Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10741Full 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:18Z | - |
| dc.date.available | 2015-11-24T17:00:18Z | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10741 | - |
| dc.rights | Default Licence | - |
| dc.subject | perfectly orderable graph | en |
| dc.subject | comparability graph | en |
| dc.subject | p-4-comparability graph | en |
| dc.subject | recognition | en |
| dc.subject | p-4-component | en |
| dc.subject | p-4-transitive orientation | en |
| dc.subject | perfectly orderable graphs | en |
| dc.subject | comparability | en |
| dc.subject | algorithms | en |
| dc.title | On the recognition of P-4-comparability 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 | 2002 | - |
| heal.abstract | We consider the problem of recognizing whether a simple undirected graph is a P-4-comparability graph. This problem has been considered by Hoang and Reed who described an O(n(4))-time algorithm for its solution, where n is the number of vertices of the given graph. Faster algorithms have recently been presented by Raschle and Simon and by Nikolopoulos and Palios; the time complexity of both algorithms is O(n + m(2)), where m is the number of edges of the graph. In this paper, we describe an O(n m)-time, O(n + m)-space algorithm for the recognition of P-4-comparability graphs. The algorithm computes the P(4)s of the input graph G by means of the BFS-trees of the complement of G rooted at each of its vertices, without however explicitly computing the complement of G. Our algorithm is simple, uses simple data structures, and leads to an O(n m)-time algorithm for computing an acyclic P-4-transitive orientation of a P-4-comparability graph. | en |
| heal.journalName | Graph-Theoretic Concepts in Computer Science | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nikolopoulos-2002-On the recognition of P-4-comparability graphs.pdf | 693.7 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
