Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/12619Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Papadopoulos, C. | en |
| dc.contributor.author | Lokshtanov, D. | en |
| dc.contributor.author | Mancini, F. | en |
| dc.date.accessioned | 2015-11-24T17:22:28Z | - |
| dc.date.available | 2015-11-24T17:22:28Z | - |
| dc.identifier.issn | 0166-218X | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12619 | - |
| dc.rights | Default Licence | - |
| dc.title | Characterizing and computing minimal cograph completions | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.secondary | http://www.ii.uib.no/publikasjoner/texrap/pdf/2008-352.pdf | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2010 | - |
| heal.abstract | A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is a vertex incremental algorithm to compute a minimal cograph completion H of an arbitrary input graph G in O(|V (H)| + |E(H)|) time. | en |
| heal.publisher | Elsevier | en |
| heal.journalName | Discrete Applied Mathematics | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Papadopoulos-2010-characterizing and computing.pdf | 270.89 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
