Abstract
Graph visualization techniques aim to help users obtain deep insights about the structure and evolution of graphs through minimizing visual confusion and real-time updating of the drawing. This demands high effectiveness of the drawing algorithms to produce layout of graphs with few edge crossings. However, the classical force-directed algorithms fail to satisfy this requirement. In this paper, we solve this problem by using a novel and heuristic pre-positioning method based on a variant of the PageRank algorithm. In our algorithmic framework, five models are proposed to calculate the importance degree of each vertex, the relation matrix of the vertices, the layer each vertex belongs to, the available placing coordinates and the matching coefficient between a vertex and a position. After the pre-positioning procedure of each layer, the classical force-directed algorithm is used to calculate the final position of each vertex. Experimental results have shown that our approach can reduce the computing time as well as the number of edge crossings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
