Drawing graphs using modular decomposition
| dc.contributor.author | Papadopoulos, C. | en |
| dc.contributor.author | Voglis, C. | en |
| dc.date.accessioned | 2015-11-24T17:23:05Z | |
| dc.date.available | 2015-11-24T17:23:05Z | |
| dc.identifier.issn | 1526-1719 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/12697 | |
| dc.rights | Default Licence | - |
| dc.title | Drawing graphs using modular decomposition | en |
| heal.abstract | In this paper we present an algorithm for drawing an undirected graph G that takes advantage of the structure of the modular decomposition tree of G. Specifically, our algorithm works by traversing the modular decomposition tree of the input graph G on n vertices and m edges in a bottom-up fashion until it reaches the root of the tree, while at the same time intermediate drawings are computed. In order to achieve aestheti- cally pleasing results, we use grid and circular placement techniques, and utilize an appropriate modification of a well-known spring embedder al- gorithm. It turns out, that for some classes of graphs, our algorithm runs in O(n+m) time, while in general, the running time is bounded in terms of the processing time of the spring embedder algorithm. The result is a drawing that reveals the structure of the graph G and preserves certain aesthetic criteria. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.journalName | Journal of Graph Algorithms and Applications | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 2007 | - |
| heal.publisher | Brown University | en |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Αρχεία
Φάκελος/Πακέτο αδειών
1 - 1 of 1
Φόρτωση...
- Ονομα:
- license.txt
- Μέγεθος:
- 1.74 KB
- Μορφότυπο:
- Item-specific license agreed upon to submission
- Περιγραφή: