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”

Three-dimensional graph drawing by Kamada-Kawai method with Barzilai-Borwein method

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10241742" target="_blank" >RIV/61989100:27240/18:10241742 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27740/18:10241742

  • Result on the web

    <a href="https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8285432" target="_blank" >https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8285432</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Three-dimensional graph drawing by Kamada-Kawai method with Barzilai-Borwein method

  • Original language description

    This article presents a modification of KamadaKawai method (KK) which was designed to produce layouts of simple undirected graphs. Graphs drawn by Kamada-Kawai algorithm exhibit symmetries, tend to produce crossing-free layouts for planar graphs. Original KK uses Newton-Raphson method which needs computation of Hessian matrix in every iteration. It requires higher number of computational operations. This prevents the usage of this method for both large graphs and three-dimensional graphs. Presented idea is to modify KK by Barzilai- Borwein method (BB) which is also iterative method and does not work with Hessian matrix. It enables to use the advantage of the &apos;spring&apos; theory from KK and removes the computational demands of KK. In this article we test presented modification for the drawing of three-dimensional graph.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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)

Others

  • Publication year

    2018

  • 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

    2017 IEEE Symposium Series on Computational Intelligence, SSCI 2017 - Proceedings

  • ISBN

    978-1-5386-2725-9

  • ISSN

  • e-ISSN

    neuvedeno

  • Number of pages

    7

  • Pages from-to

    1-7

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Honolulu

  • Event date

    Nov 27, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000428251401077