A force-directed algorithm for drawing directed graphs symmetrically

DOI10.1155/2018/6208509zbMath1427.68256OpenAlexW2901890551WikidataQ128927481 ScholiaQ128927481MaRDI QIDQ1721190

Taihua Xu, Guanglei Gou, Jie Yang

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/6208509

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

An annotated review on graph drawing and its applications

Uses Software

• Pajek
• Pajek datasets
• PIGALE
• Gephi
• ForceAtlas2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Area requirement and symmetry display of planar upward drawings
• An algorithm for drawing general undirected graphs
• An efficient algorithm for determining the convex hull of a finite planar set
• Improved Circular Layouts
• Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
• A forced directed component placement procedure for printed circuit boards
• GRIP: Graph Drawing with Intelligent Placement
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• Computing Radial Drawings on the Minimum Number of Circles
• Depth-First Search and Linear Graph Algorithms
• Graph Drawing
• Graph Drawing
• A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs