Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/10915Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Nikolopoulos, Stavros D. | en |
| dc.contributor.author | Palios, Leonidas | en |
| dc.contributor.author | Papadopoulos, Charis | en |
| dc.date.accessioned | 2015-11-24T17:01:23Z | - |
| dc.date.available | 2015-11-24T17:01:23Z | - |
| dc.identifier.issn | 0304-3975 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10915 | - |
| dc.rights | Default Licence | - |
| dc.subject | Fully dynamic algorithm | en |
| dc.subject | P 4 -sparse graph | en |
| dc.subject | Modular decomposition | en |
| dc.subject | Recognition | en |
| dc.title | A fully dynamic algorithm for the recognition of P4-sparse graphs | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.primary | 10.1016/j.tcs.2012.03.020 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.publicationDate | 2006 | - |
| heal.abstract | In 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.journalName | Theoretical Computer Science | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| nikolopoulos-2011-A fully dynamic algorithm for the recognition of P4-sparse graphs.pdf | 533.85 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
