Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10861Full 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:03Z | - |
| dc.date.available | 2015-11-24T17:01:03Z | - |
| dc.identifier.issn | 1365-8050 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10861 | - |
| dc.rights | Default Licence | - |
| dc.subject | bipolarizable (raspail) graphs | en |
| dc.subject | p-4-simplicial graphs | en |
| dc.subject | perfectly orderable graphs | en |
| dc.subject | recognition | en |
| dc.subject | algorithms | en |
| dc.subject | complexity | en |
| dc.subject | perfectly orderable graphs | en |
| dc.subject | brittle graphs | en |
| dc.subject | linear-time | en |
| dc.subject | orientation | en |
| dc.subject | algorithms | en |
| dc.subject | complexity | en |
| dc.title | On the recognition of bipolarizable and P-4-simplicial 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 | 2005 | - |
| heal.abstract | The classes of Raspail ( also known as Bipolarizable) and P-4-simplicial graphs were introduced by Hoang and Reed who showed that both classes are perfectly orderable and admit polynomial-time recognition algorithms [16]. In this paper, we consider the recognition problem on these classes of graphs and present algorithms that solve it in O(nm) time. In particular, we prove properties of the graphs investigated and show that we can produce bipolarizable and P-4-simplicial orderings on the vertices of the input graph G, if such orderings exist, working only on P(3)s that participate in a P-4 of G. The proposed recognition algorithms are simple, use simple data structures and both require O(n+m) space. Additionally, we show how our recognition algorithms can be augmented to provide certificates, whenever they decide that G is not bipolarizable or P-4-simplicial; the augmentation takes O(n + m) time and space. Finally, we include a diagram on class inclusions and the currently best recognition time complexities for a number of perfectly orderable classes of graphs. | 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 | |
|---|---|---|---|---|
| nikolopoulos-2005-On the recognition of bipolarizable and P-4-simplicial graphs.pdf | 310.4 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
