All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Visualization of large graphs using GPU computing

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86088854" target="_blank" >RIV/61989100:27240/13:86088854 - isvavai.cz</a>

  • Result on the web

    <a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6630509&tag=1" target="_blank" >http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6630509&tag=1</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/INCoS.2013.126" target="_blank" >10.1109/INCoS.2013.126</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Visualization of large graphs using GPU computing

  • Original language description

    Graphs may be used to visualize relationships between objects. Relations are represented by edges and objects are called nodes. When graph is drawn, one can easily see and understand the basic structure of data. Many different applications can be found in social network analysis, computer networks, scientific literature analysis, etc. However drawing large graphs (thousands or a millions of nodes), is still challenging problem. There exist many different algorithms for drawing graphs. Each algorithm hasspecific behavior and different applications and limits. Some algorithms are focused on quality while others are more suitable for large graphs. This paper aims to speed up the computation using GPU, so larger graphs can be visualized in acceptable time, or visualization can be done even in real-time.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2013

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings - 5th International Conference on Intelligent Networking and Collaborative Systems, INCoS 2013

  • ISBN

    978-0-7695-4988-0

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    662-667

  • Publisher name

    IEEE

  • Place of publication

    Danvers

  • Event location

    Xi'an

  • Event date

    Sep 9, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article