Multitree-like Graph Layering Crossing Optimization

Radek Mařík

Abstract

We improve a method of multitree-like 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 order of subtrees selected by the driving spanning tree can be derived from the actual edge crossings. Such a subtree order leads to additional decreasing of total edge crossings from 1% to 50%. This depends on the shape of the processed graph, ranging from a pure tree to a general acyclic graph. Our achievements are demonstrated using several datasets containing up to millions of people, species, or services. The proposed subtree ordering method of layered graphs that are similar to acyclic multitrees retains the generating of acceptable layouts in almost linear time.

Download


Paper Citation


in Harvard Style

Mařík R. (2019). Multitree-like Graph Layering Crossing Optimization.In Proceedings of the 14th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP, ISBN 978-989-758-354-4, pages 233-240. DOI: 10.5220/0007345302330240


in Bibtex Style

@conference{ivapp19,
author={Radek Mařík},
title={Multitree-like Graph Layering Crossing Optimization},
booktitle={Proceedings of the 14th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP,},
year={2019},
pages={233-240},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007345302330240},
isbn={978-989-758-354-4},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 14th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 3: IVAPP,
TI - Multitree-like Graph Layering Crossing Optimization
SN - 978-989-758-354-4
AU - Mařík R.
PY - 2019
SP - 233
EP - 240
DO - 10.5220/0007345302330240