Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/12973
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPapadopoulos, C.en
dc.contributor.authorHeggernes, P.en
dc.contributor.authorMeister, D.en
dc.date.accessioned2015-11-24T17:24:54Z-
dc.date.available2015-11-24T17:24:54Z-
dc.identifier.issn1571-0653-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/12973-
dc.rightsDefault Licence-
dc.subjectproperinterval graphs, representation model, clique-widthen
dc.titleA new representation of properinterval graphs with an application to clique-widthen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primary10.1016/j.endm.2009.02.005-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.publicationDate2009-
heal.abstractWe 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.publisherElsevieren
heal.journalNameElectronic Notes in Discrete Mathematicsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Papadopoulos-2009-a new representation.pdf195.36 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons