Tree-based Genealogical Graph Layout
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F16%3A00310442" target="_blank" >RIV/68407700:21230/16:00310442 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/book/10.1007/978-3-319-50106-2" target="_blank" >http://link.springer.com/book/10.1007/978-3-319-50106-2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-50106-2" target="_blank" >10.1007/978-3-319-50106-2</a>
Alternative languages
Result language
angličtina
Original language name
Tree-based Genealogical Graph Layout
Original language description
While a visual unconstrained tree structure planar layout design is easy to implement, a visualization of a tree with constraints on node ranks and their ordering within ranks leads to a difficult combinatorial problem. A genealogical graph can be taken as an example of such a case. We propose a new method of tree-driven graph node layout.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
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)
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
Graph Drawing and Network Visualization
ISBN
978-3-319-50106-2
ISSN
1611-3349
e-ISSN
—
Number of pages
4
Pages from-to
613-616
Publisher name
Springer
Place of publication
Cham
Event location
Athens
Event date
Sep 19, 2016
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—