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”

Barzilai-Borwein Method in Graph Drawing Algorithm Based on Kamada-Kawai Algorithm

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68145535%3A_____%2F16%3A00472759" target="_blank" >RIV/68145535:_____/16:00472759 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27240/16:86099903 RIV/61989100:27740/16:86099903

  • Result on the web

    <a href="http://aip.scitation.org/doi/pdf/10.1063/1.4952138" target="_blank" >http://aip.scitation.org/doi/pdf/10.1063/1.4952138</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1063/1.4952138" target="_blank" >10.1063/1.4952138</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Barzilai-Borwein Method in Graph Drawing Algorithm Based on Kamada-Kawai Algorithm

  • Original language description

    Extension of Kamada-Kawai algorithm, which was designed for calculating layouts of simple undirected graphs, is presented in this paper. Graphs drawn by Kamada-Kawai algorithm exhibit symmetries, tend to produce aesthetically pleasing and crossing-free layouts for planar graphs. Minimization of Kamada-Kawai algorithm is based on Newton-Raphson method, which needs Hessian matrix of second derivatives of minimized node. Disadvantage of Kamada-Kawai embedder algorithm is computational requirements. This is caused by searching of minimal potential energy of the whole system, which is minimized node by node. The node with highest energy is minimized against all nodes till the local equilibrium state is reached. In this paper with Barzilai-Borwein (BB) minimization algorithm, which needs only gradient for minimum searching, instead of Newton-Raphson method, is worked. It significantly improves the computational time and requirements.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BA - General mathematics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2016

  • 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

    International Conference of Numerical Analysis and Applied Mathematics 2015 (ICNAAM 2015)

  • ISBN

    978-0-7354-1392-4

  • ISSN

    0094-243X

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

  • Publisher name

    AIP Publishing

  • Place of publication

    New York

  • Event location

    Rhodos

  • Event date

    Sep 23, 2015

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    000380803300364