A simple linear-time recognition algorithm for weakly quasi-threshold graphs€

dc.contributor.authorPapadopoulos, C.en
dc.contributor.authorNikolopoulos, S.en
dc.date.accessioned2015-11-24T17:26:11Z
dc.date.available2015-11-24T17:26:11Z
dc.identifier.issn0911-0119-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13161
dc.rightsDefault Licence-
dc.subjectWeakly quasi-threshold graphs, cographs, forbidden induced subgraphs, recog-en
dc.subjectnition, linear-time algorithmsen
dc.titleA simple linear-time recognition algorithm for weakly quasi-threshold graphs€en
heal.abstractWeakly 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.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameGraphs and Combinatoricsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2011-
heal.publisherSpringer Verlag (Germany)en
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: