A fully dynamic algorithm for the recognition of P4-sparse graphs

dc.contributor.authorNikolopoulos, Stavros D.en
dc.contributor.authorPalios, Leonidasen
dc.contributor.authorPapadopoulos, Charisen
dc.date.accessioned2015-11-24T17:01:23Z
dc.date.available2015-11-24T17:01:23Z
dc.identifier.issn0304-3975-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10915
dc.rightsDefault Licence-
dc.subjectFully dynamic algorithmen
dc.subjectP 4 -sparse graphen
dc.subjectModular decompositionen
dc.subjectRecognitionen
dc.titleA fully dynamic algorithm for the recognition of P4-sparse graphsen
heal.abstractIn this paper, we solve the dynamic recognition problem for the class of P 4 -sparse graphs: the objective is to handle edge/vertex additions and deletions, to recognize if each such modification yields a P 4 -sparse graph, and if yes, to update a representation of the graph. Our approach relies on maintaining the modular decomposition tree of the graph, which we use for solving the recognition problem. We establish properties for each modification to yield a P 4 -sparse graph and obtain a fully dynamic recognition algorithm which handles edge modifications in O ( 1 ) time and vertex modifications in O ( d ) time for a vertex of degree  d . Thus, our algorithm implies an optimal edges-only dynamic algorithm and a new optimal incremental algorithm for P 4 -sparse graphs.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.identifier.primary10.1016/j.tcs.2012.03.020-
heal.journalNameTheoretical Computer Scienceen
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
Περιγραφή: