By Topic

Polytree Numbering for Citation Networks Visualisation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Logvynovskiy, A. ; Sch. of Comput., Inf. Technol. & Eng., Univ. of East London, London, UK ; Dastbaz, M.

Citation networks form directed acyclic graphs. Visualisation of the reference relationships within the network requires fast determination of ancestor-descendant relationships among the nodes within the digraph. Polytrees (singly connected digraphs) constitute an important class of acyclic digraphs and can be viewed as generalised directed trees where multiple parent nodes are permitted. In this paper, we propose a new ancestral numbering scheme for polytrees that allows fast determination of ancestor-descendant relationships among the nodes without traversal. The scheme is used to index and visualise reference relationships within citation networks.

Published in:

Information Visualisation (IV), 2010 14th International Conference

Date of Conference:

26-29 July 2010