• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A comparison of visualisation techniques for complex networks

Gummesson, Viktor January 2016 (has links)
The need to visualise sets of data and networks within a company is awell-known task. In this thesis, research has been done of techniques used to visualize complex networks in order to find out if there is a generalized optimal technique that can visualize complex networks. For this purpose an application was implemented containing three different views, which were selected from the research done on the subject. As it turns out, it points toward that there is no generalized optimal technique that can be used to default visualize complex networksin a satisfactory way. A definit conclusion could not be given due to the fact that all visualization techniques which could not be evaluated within this thesis timeframe. / Behov av att visualisera data inom bolag är ett känt faktum. Denna avhandling har använt olika tekniker för att undersöka om det existerar en generell optimal teknik som kan tillämpas vid visualisering av komplexa nätverk. Vid genomförandet implementerades en applikation med tre olika vyer som valdes ut baserat på forskning inom det valda området. Resultatet visade att det inte existerar en generell optimalteknik som kan tillämpas vid visualisering av komplexa nätverk, det medför att en definitiv slutsats inte kan dras. Det på grund av att alla de visualiseringstekniker som existerar inte kunde undersökas inom examensarbetets tidsram.

Page generated in 0.0436 seconds