Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10766Full 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:25Z | - |
| dc.date.available | 2015-11-24T17:00:25Z | - |
| dc.identifier.issn | 0302-9743 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10766 | - |
| dc.rights | Default Licence | - |
| dc.subject | bipolarizable (raspail) graph | en |
| dc.subject | p-4-simplicial graph | en |
| dc.subject | perfectly orderable graph | en |
| dc.subject | recognition | en |
| dc.subject | algorithm | en |
| dc.subject | complexity | en |
| dc.subject | forbidden subgraph | en |
| dc.subject | perfectly orderable graphs | en |
| dc.subject | recognition algorithm | en |
| dc.subject | brittle graphs | en |
| dc.subject | linear-time | en |
| dc.subject | complexity | en |
| dc.title | Recognizing 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 | 2003 | - |
| heal.abstract | Hoang and Reed defined the classes of Raspail (also known as Bipolarizable) and P-4-simplicial graphs, both of which are perfectly orderable, and proved that they 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, where n and m are the numbers of vertices and of edges of the input graph. In particular, we prove properties and show that we can produce bipolarizable and P-4-simplicial orderings on the vertices of a graph G, if such orderings exist, working only on P(3)s that participate in P(4)s of G. The proposed recognition algorithms are simple, use simple data structures and require O(n + m) space. Moreover, we present a diagram on class inclusions and the currently best recognition time complexities for a number of perfectly orderable classes of graphs and some preliminary results on forbidden subgraphs for the class of P-4-simplicial graphs. | 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-2003-Recognizing bipolarizable and P-4-simplicial graphs.pdf | 213.02 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
