Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10858
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nikolopoulos, S. D. | en |
dc.contributor.author | Palios, L. | en |
dc.date.accessioned | 2015-11-24T17:01:02Z | - |
dc.date.available | 2015-11-24T17:01:02Z | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10858 | - |
dc.rights | Default Licence | - |
dc.subject | perfect graphs | en |
dc.subject | p-4-sparse graphs | en |
dc.subject | cographs | en |
dc.subject | maximum-size subgraphs | en |
dc.subject | maximum matchings | en |
dc.subject | perfect matching | en |
dc.subject | recognition algorithm | en |
dc.subject | p-4-sparse graphs | en |
dc.subject | cographs | en |
dc.title | Maximum-size subgraphs of P4-sparse graphs admitting a perfect matching | en |
heal.type | journalArticle | - |
heal.type.en | Journal article | en |
heal.type.el | Άρθρο Περιοδικού | el |
heal.language | en | - |
heal.access | campus | - |
heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
heal.publicationDate | 2005 | - |
heal.abstract | In 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.journalName | Advances in Informatics, Proceedings | en |
heal.journalType | peer reviewed | - |
heal.fullTextAvailability | TRUE | - |
Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
nikolopoulos-2005-Maximum-size subgraphs of P4-sparse graphs admitting a perfect matching.pdf | 202.48 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License