Abstract
dc:descriptionThe display of Graphs, is widely used for the visualization of data or information. Although it is important to show all the information represented by the edges and the nodes of the graph, there are cases where this is either impossible due to the complexity and the size of the graphs or even misleadingsince the graph could be very dense, while other reasons may be related to privacy protection (e.g.,social network graphs). To overcome this challenge, different approaches imply to hide the unnecessary or redundant information or even replace the original graph with a subgraph or a summary. The main objective of this dissertation is to investigate and elaborate on the visualization and analysis of large graphs. More specifically, regarding visualization we design and implement variousversions of a new sophisticated framework of graph layout techniques that focus on the idea of improving the visualization aesthetics, in order to reduce the visualization complexity of the graph, on top of sophisticated graph drawing layouts. These techniques can be categorized in two main groups.The first category is with respect to bends while the second is based on edge removal. To this respect, we perform a set of experiments that show that these techniques produce progressively more abstract drawings of the input graph. No dummy vertices are introduced and the vertices of each path/channel are vertically aligned. Subsequently, the value of the introduced approach is that it also provides ageneric and parameterized visualization method based on the given scenario. Towards this direction, wealso elaborate on methods for grouping nodes with similar characteristics that naturally decomposes the graph based on the information derived by the edges within the graph, which can be used in order tohave better visualization of complex networks. In order to evaluate our drawing layout techniques, we assess the usability of various versions of our new layout compared with the one produced by other hierarchical drawing techniques. As a result,we provide insights regarding the factors that affect efficiency so introduce a set of metrics in order to evaluate the performance of these techniques. Our algorithms require almost linear time. Moreover, we design and conduct a comparative task-based evaluation with users in which we ask the participants to carry them out in order to extract the user's satisfaction level and exploit any possible problems and difficulties as regards the reachability information. Generally, the drawings produced by our algorithms have lower number of bends and are significantly smaller in area. The user evaluation also reveals thatthe performance of the participants is slightly better in the drawings of our proposed model and that our model is preferred in overall rating compared to the other model.
Degree
thesis:*- Grantor dc:publisher
- University of Crete (UOC)
- Year dc:date
- 2023
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Lionakis, Panagiotis
- Λιονάκης, Παναγιώτης
Subjects
dc:subject × 20- Οπτικοποίηση γράφων
- Κατευθυνόμενος άκυκλος γράφος
- Δίκτυο με τιμές στις ακμές του
- Αλγόριθμοι γράφων
- Οπτικοποίηση πληροφοριών
- Πειραματική έρευνα
- Graph visualization
- Directed acyclic graph (DAG)
- Graph algorithms
- Information visualization
- Experimental study
- Reachability
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Φυσικές Επιστήμες
- Επιστήμη ηλεκτρονικών υπολογιστών, θεωρία και μέθοδοι
- Λογισμικό (software)
- Computer and Information Sciences
- Natural Sciences
- Computer science, theory and methods
- Software
Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/53686