Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13487
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPapadopoulos, C.en
dc.contributor.authorHeggernes, P.en
dc.date.accessioned2015-11-24T17:28:01Z-
dc.date.available2015-11-24T17:28:01Z-
dc.identifier.issn0304-3975-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13487-
dc.rightsDefault Licence-
dc.titleSingle-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletionsen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.publicationDate2009-
heal.abstractWe study graph properties that admit an increasing, or equivalently decreasing, sequence of graphs on the same vertex set such that for any two consecutive graphs in the sequence their difference is a single edge. This is useful for characterizing and computing minimal completions and deletions of arbitrary graphs into having these properties. We prove that threshold graphs and chain graphs admit such sequences. Based on this characterization and other structural properties, we present linear-time algorithms both for computing minimal completions and deletions into threshold, chain, and bipartite graphs, and for extracting a minimal completion or deletion from a given completion or deletion. Minimum completions and deletions into these classes are NP-hard to compute.en
heal.publisherElsevieren
heal.journalNameTheoretical Computer Scienceen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
Papadopoulos-2009-single edge monotonic.pdf272.31 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons