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”

A New Iterative Approach for Finding Nearest Neighbors Using Space-Filling Curves for Fast Graphs Visualization

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F14%3A86090883" target="_blank" >RIV/61989100:27240/14:86090883 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/14:86090883

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-07995-0_2" target="_blank" >http://dx.doi.org/10.1007/978-3-319-07995-0_2</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-07995-0_2" target="_blank" >10.1007/978-3-319-07995-0_2</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A New Iterative Approach for Finding Nearest Neighbors Using Space-Filling Curves for Fast Graphs Visualization

  • Original language description

    Graphs in the computer science are widely used in social network analysis, computer networks, transportation networks, and many other areas. In general, they can visualize relationships between objects. However, fast drawing of graphs with readable layouts is still a challenge. This paper aims to the speed up the original Fruchterman-Reingold graph layout algorithm by computing repulsive forces only between vertices that are near each other. A new approach based on the selected space-filling curves is described.

  • 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

    2014

  • 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

    Advances in intelligent systems and computing. Volume 299

  • ISBN

    978-3-319-07994-3

  • ISSN

    2194-5357

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    11-20

  • Publisher name

    Springer

  • Place of publication

    Basel

  • Event location

    Bilbao

  • Event date

    Jun 25, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000343754200002