On multitree-like graph layering

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00320685" target="_blank" >RIV/68407700:21230/18:00320685 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-3-319-72150-7_48" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-319-72150-7_48</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-72150-7_48" target="_blank" >10.1007/978-3-319-72150-7_48</a>

Result language
angličtina
Original language name
On multitree-like graph layering
Original language description
We leverage a method of multitree graph visualization using a spanning tree-driven layout technique with constraints specified by layers and the ordering of groups of nodes within layers. We propose a new method of how the driving spanning tree can be selected using graph blocks and the simplex method. We demonstrate achievements using several datasets containing up to 10 6 people or species. The proposed layout method of layered graphs that are similar to acyclic multitrees creates aesthetically acceptable layouts in linear time.
Czech name
—
Czech description
—

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)

Project
<a href="/en/project/GA16-07210S" target="_blank" >GA16-07210S: Complex Networks Methods Applied to Ancient Egypt Data in the Old Kingdom (2700-2180 BC)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)