Maximum-size subgraphs of P4-sparse graphs admitting a perfect matching

Απλή σελίδα τεκμηρίου
dc.contributor.authorNikolopoulos, S. D.en
dc.contributor.authorPalios, L.en
dc.date.accessioned2015-11-24T17:01:02Z
dc.date.available2015-11-24T17:01:02Z
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10858
dc.rightsDefault Licence-
dc.subjectperfect graphsen
dc.subjectp-4-sparse graphsen
dc.subjectcographsen
dc.subjectmaximum-size subgraphsen
dc.subjectmaximum matchingsen
dc.subjectperfect matchingen
dc.subjectrecognition algorithmen
dc.subjectp-4-sparse graphsen
dc.subjectcographsen
dc.titleMaximum-size subgraphs of P4-sparse graphs admitting a perfect matchingen
heal.abstractIn this paper, we address the problem of computing a maximum-size subgraph of a P-4-sparse graph which admits a perfect matching; in the case where the graph has a perfect matching, the solution to the problem is the entire graph. We establish a characterization of such subgraphs, and describe an algorithm for the problem which for a P-4-sparse graph on n vertices and m edges, runs in O(n + m) time and space. The above results also hold for the class of complement reducible graphs or cographs, a well-known subclass of P-4-sparse graphs.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameAdvances in Informatics, Proceedingsen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2005-
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
Περιγραφή:
Κατεβάστε

Συλλογές

Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)