Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13150Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Papadopoulos, C. | en |
| dc.date.accessioned | 2015-11-24T17:26:06Z | - |
| dc.date.available | 2015-11-24T17:26:06Z | - |
| dc.identifier.issn | 0911-0119 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13150 | - |
| dc.rights | Default Licence | - |
| dc.subject | weakly quasi-threshold graphs | en |
| dc.subject | cographs | en |
| dc.subject | forbidden induced subgraphs | en |
| dc.subject | recognition | en |
| dc.subject | linear-time algorithms | en |
| dc.subject | cograph recognition | 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.identifier.primary | DOI 10.1007/s00373-010-0983-0 | - |
| heal.identifier.secondary | <Go to ISI>://000291868300008 | - |
| heal.identifier.secondary | http://www.springerlink.com/content/p88676568078tw3x/fulltext.pdf | - |
| 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 finite set of forbidden subgraphs: the class of weakly quasi-threshold graphs coincides with the class of {P(4), co-(2P(3))}-free graphs. Moreover we give the first 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 certificates 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 finding 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 | |
|---|---|---|---|---|
| Nikolopoulos-2011-A Simple Linear-Time.pdf | 205.79 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
