Vertex splitting and tension-free layout-Reference-Cited by-同舟云学术

Vertex splitting and tension-free layout

Published:1996 Issue: Volume: Page:202-211
ISSN:0302-9743
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Eades P.,de Mendonça N C. F. X.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0021804

Reference9 articles.

1. P. Eades, W. Lai, and X. Mendonça. A Visualizer for E-mail Trafic. In 4th Int. Conf. Proc. Pacific Graphics'94 / CADDM'94, pages 64–67, 1994.

2. P. D. Eades. A Heuristic for Graph Drawing. Congr. Numer., 42:149–160, 1984.

3. T. Kamada. Visualizing Abstract Objects and Relations. World Scientific, 1989.

4. T. Kamada and S. Kawai. Automatic Display of Network Structures for Human Understanding. Technical Report 88-007, Department of Information Science Faculty of Science, University of Tokyo, Tokyo, 1988.

5. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7–15, 1989.

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

1. Visualization of Bipartite Graphs in Limited Window Size;Lecture Notes in Computer Science;2024

2. Improving readability of static, straight-line graph drawings: A first look at edge crossing resolution through iterative vertex splitting;Computers & Graphics;2023-11

3. Spanning hypertrees, vertex tours and meanders;European Journal of Combinatorics;2023-10

4. Splitting Vertices in 2-Layer Graph Drawings;IEEE Computer Graphics and Applications;2023-05-01

5. The search for Minimal Search: A graph-theoretic approach;Biolinguistics;2023-03-01