Minimal separators in P-4-sparse graphs

dc.contributor.authorNikolopoulos, S. D.en
dc.contributor.authorPalios, L.en
dc.date.accessioned2015-11-24T17:01:22Z
dc.date.available2015-11-24T17:01:22Z
dc.identifier.issn0012-365X-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10913
dc.rightsDefault Licence-
dc.subjectminimal separationen
dc.subjectp-4-sparse graphsen
dc.subjectcographsen
dc.subjectperfect graphsen
dc.subjectlinear-timeen
dc.subjectrecognition algorithmen
dc.subjectp4-sparse graphsen
dc.titleMinimal separators in P-4-sparse graphsen
heal.abstractIn this paper, we determine the minimal separators of P-4-sparse graphs and establish bounds on their number. Specifically, we show that a P-4-sparse graph G on n vertices and to edges has fewer than 2n/3 minimal separators of total description size at most 4m/3. The bound on the number of minimal separators is tight and is also tight for the class of cographs, a well known subclass of the P-4-sparse graphs. Our results enable us to present a linear-time and linear-space algorithm for computing the number of minimal separators of a given P-4-sparse graph; the algorithm can be modified to report the minimal separators of the input graph in linear time and space as well. (c) 2006 Elsevier B.V. All rights reserved.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.identifier.primaryDOI 10.1016/j.disc.2005.12.008-
heal.journalNameDiscrete Mathematicsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2006-
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
Περιγραφή: