Straight-line drawing algorithms for hierarchical graphs and clustered graphs-Reference-Cited by-同舟云学术

Straight-line drawing algorithms for hierarchical graphs and clustered graphs

Published:1997 Issue: Volume: Page:113-128
ISSN:0302-9743
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Eades Peter,Feng Qing-Wen,Lin Xuemin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-62495-3_42.pdf

Reference21 articles.

1. G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61:175–198, 1988.

2. J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, New York, N.Y., 1976.

3. P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 424–437, 1991.

4. Peter Eades and Qing-Wen Feng. Orthogonal grid drawing of clustered graphs. Technical Report 96-04, Department of Computer Science, The University of Newcastle, Australia, 1996.

5. Peter D. Eades, Xuemin Lin, and Roberto Tamassia. An algorithm for drawing a hierarchical graph. International Journal of Computational Geometry and Applications, 1995.

Cited by 36 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Geographic coordinate validation and assignment using an edge-constrained layout;Journal of Engineering and Applied Science;2024-05-10

2. Graph partitioning and visualization in graph mining: a survey;Multimedia Tools and Applications;2022-05-23

3. Antialiased Digital Pixel Plotting for Raster Scan Lines Using Area Evaluation;Emerging Research in Computing, Information, Communication and Applications;2016

4. Hanani-Tutte and Related Results;Bolyai Society Mathematical Studies;2013

5. Analysis and Visualization of Relations in eLearning;Computer Communications and Networks;2009-11-06