A Complete Characterisation of the Linear Clique-Width of Path Powers
| dc.contributor.author | Papadopoulos, C. | en |
| dc.contributor.author | Heggernes, P. | en |
| dc.contributor.author | Meister, D. | en |
| dc.date.accessioned | 2015-11-24T17:23:05Z | |
| dc.date.available | 2015-11-24T17:23:05Z | |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12695 | |
| dc.rights | Default Licence | - |
| dc.title | A Complete Characterisation of the Linear Clique-Width of Path Powers | en |
| heal.abstract | A k-path power is the k-power graph of a simple path of arbitrary length. Path powers form a non-trivial subclass of proper interval graphs. Their clique-width is not bounded by a constant, and no polynomial-time algorithm is known for computing their clique-width or linear clique-width. We show that k-path powers above a certain size have linear clique-width exactly k?+?2, providing the first complete characterisation of the linear clique-width of a graph class of unbounded clique-width. Our characterisation results in a simple linear-time algorithm for computing the linear clique-width of all path powers. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.identifier.primary | 10.1007/978-3-642-02017-9_27 | - |
| heal.journalName | Theory and Applications of Models of Computation | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 2009 | - |
| heal.publisher | Springer-Verlag | en |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: