Circular tree drawing by simulating network synchronisation dynamics and scaling

Farshad Ghassemi Toosi, Nikola S. Nikolov

Research output: Contribution to journalArticlepeer-review

Abstract

We present an algorithm which produces circular-shape layouts of trees by simulating synchronisation dynamics on the tree. Our approach consists of evolving scalar dynamical values assigned to the nodes. Then the dissimilarities between the values of each pair of nodes are utilised to calculate the coordinates of the nodes by using a lower bound on dissimilarities and scaling up the lower bound per iteration.

Original languageEnglish
Pages (from-to)511-512
Number of pages2
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8871
Publication statusPublished - 2014

Fingerprint

Dive into the research topics of 'Circular tree drawing by simulating network synchronisation dynamics and scaling'. Together they form a unique fingerprint.

Cite this