Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/12973
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Papadopoulos, C. | en |
dc.contributor.author | Heggernes, P. | en |
dc.contributor.author | Meister, D. | en |
dc.date.accessioned | 2015-11-24T17:24:54Z | - |
dc.date.available | 2015-11-24T17:24:54Z | - |
dc.identifier.issn | 1571-0653 | - |
dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12973 | - |
dc.rights | Default Licence | - |
dc.subject | properinterval graphs, representation model, clique-width | en |
dc.title | A new representation of properinterval graphs with an application to clique-width | en |
heal.type | journalArticle | - |
heal.type.en | Journal article | en |
heal.type.el | Άρθρο Περιοδικού | el |
heal.identifier.primary | 10.1016/j.endm.2009.02.005 | - |
heal.language | en | - |
heal.access | campus | - |
heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
heal.publicationDate | 2009 | - |
heal.abstract | We introduce anewrepresentation of properinterval graphs that can be computed in linear time and stored in O(n) space. This representation is a 2-dimensional vertex partition. It is particularly interesting with respect to clique-width. Based on this representation, we prove new upper bounds on the clique-width of properinterval graphs. | en |
heal.publisher | Elsevier | en |
heal.journalName | Electronic Notes in Discrete Mathematics | en |
heal.journalType | peer reviewed | - |
heal.fullTextAvailability | TRUE | - |
Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Papadopoulos-2009-a new representation.pdf | 195.36 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License