Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10815Full 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 | 0178-4617 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10815 | - |
| dc.rights | Default Licence | - |
| dc.subject | perfectly orderable graph | en |
| dc.subject | comparability graph | en |
| dc.subject | p-4-comparability graph | en |
| dc.subject | p-4-component | en |
| dc.subject | recognition | en |
| dc.subject | p-4-transitive orientation | en |
| dc.subject | perfectly orderable graphs | en |
| dc.subject | comparability-graphs | en |
| dc.subject | efficient | en |
| dc.title | Algorithms for P-4-comparability graph recognition and acyclic P-4-transitive orientation | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | DOI 10.1007/s00453-003-1075-9 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2004 | - |
| heal.abstract | We consider two problems pertaining to P-4-comparability graphs, namely, the problem of recognizing whether a simple undirected graph is a P-4-comparability graph and the problem of producing an acyclic P-4-transitive orientation of a P-4-comparability graph. These problems have been considered by HoAng and Reed who described o(n(4))- and o(n(5))-time algorithms for their solution, respectively, where n is the number of vertices of the input graph. Faster algorithms have recently been presented by Raschle and Simon, and by Nikolopoulos and Palios; the time complexity of these algorithms for either problem is o (n + m(2)), where m is the number of edges of the graph. In this paper we describe O (nm)-time and O (n + m)-space algorithms for the recognition and the acyclic P-4-transitive orientation problems on P-4-comparability graphs. The algorithms rely on properties of the P-4-components of a graph, which we establish, and on the efficient construction of the P4-components by means of the BFS-trees of the complement of the graph rooted at each of its vertices, without however explicitly computing the complement. Both algorithms are simple and use simple data structures. | en |
| heal.journalName | Algorithmica | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Nikolopoulos-2004-Algorithms for P-4-c.pdf | 412.56 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
