Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13161Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Papadopoulos, C. | en |
| dc.contributor.author | Nikolopoulos, S. | en |
| dc.date.accessioned | 2015-11-24T17:26:11Z | - |
| dc.date.available | 2015-11-24T17:26:11Z | - |
| dc.identifier.issn | 0911-0119 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13161 | - |
| dc.rights | Default Licence | - |
| dc.subject | Weakly quasi-threshold graphs, cographs, forbidden induced subgraphs, recog- | en |
| dc.subject | nition, linear-time algorithms | en |
| dc.title | A simple linear-time recognition algorithm for weakly quasi-threshold 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 | 2011 | - |
| heal.abstract | Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold graphs by a ?nite set of forbidden subgraphs: the class of weakly quasi- threshold graphs coincides with the class of fP4; co-(2P3)g-free graphs. Moreover we give the ?rst linear-time algorithm to decide whether a given graph belongs to the class of weakly quasi-threshold graphs, improving the previously known running time. Based on the simplicity of our recognition algorithm, we can provide certi?cates of membership (a structure that characterizes weakly quasi-threshold graphs) or non-membership (forbidden induced subgraphs) in additional O(n) time. Furthermore we give a linear-time algorithm for ?nding the largest induced weakly quasi-threshold subgraph in a cograph. | en |
| heal.publisher | Springer Verlag (Germany) | en |
| heal.journalName | Graphs and Combinatorics | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Papadopoulos-2011-a simple linear.pdf | 171.65 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
