Sökning: "Graph Layout Algorithms"

Visar resultat 1 - 5 av 9 uppsatser innehållade orden Graph Layout Algorithms.

  1. 1. Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Emmy Yin; [2023]
    Nyckelord :Dynamic Graphs; Graph Layout Algorithms; Visualization; Hierarchical Graph Layouts; Dynamiska grafer; grafritningsalgoritmer; visualisering; hierarkiska grafritningar;

    Sammanfattning : Graphs are powerful data structures that are widely used to represent complex forms of information. One area in which graphs are successfully being used is within compiler engineering, where a program under compilation can be represented as a graph that changes as the program is being compiled. LÄS MER

  3. 2. Co-Authorship Network Analysis in Constraint Programming Research

    Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Lana Ali; [2023]
    Nyckelord :Centrality; co-authorship; constraint programming research; graph theory; social network analysis ;

    Sammanfattning : The aim of this thesis was to study co-authorship in the constraint programming research community. This was done by conducting social network analysis (SNA) based on published scientific papers from the proceedings of the International Conference on Principles and Practice of Constraint Programming. LÄS MER

  4. 3. Efficient graph embeddings with community detection

    Master-uppsats, Umeå universitet/Institutionen för fysik

    Författare :Felix Djuphammar; [2021]
    Nyckelord :;

    Sammanfattning : Networks are useful when modeling interactions in real-world systems based on relational data. Since networks often contain thousands or millions of nodes and links, analyzing and exploring them requires powerful visualizations. LÄS MER

  5. 4. Comparison study on graph sampling algorithms for interactive visualizations of large-scale networks

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Alexandra Voroshilova; [2019]
    Nyckelord :Graph sampling; graph filtering; large graph visualization; grafreduktion; stor graf visualisering;

    Sammanfattning : Networks are present in computer science, sociology, biology, and neuroscience as well as in applied fields such as transportation, communication, medical industries. The growing volumes of data collection are pushing scalability and performance requirements on graph algorithms, and at the same time, a need for a deeper understanding of these structures through visualization arises. LÄS MER

  7. 5. Kravbaserad layout - Algoritm för automatisk grafritning

    Kandidat-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Zimin Chen; Huan Xie; [2016]
    Nyckelord :graph drawing algorithm; constraints-based; Sugiyama framework; Force-directed layout; Grafritningsalgoritm; kravbaserad; Sugiyama-ramverk; kraftbaserad layout.;

    Sammanfattning : I den här studien utformas och implementeras en prototyp av ett automatiskt grafritningsverktyg. Under processen analyseras och evalueras flera välkända och viktiga algoritmer. Algoritmen som används i prototypen modifieras och förbättras för att uppfylla företaget FindOuts speciella krav. LÄS MER