How to draw a planar clustered graph-Reference-Cited by-同舟云学术

How to draw a planar clustered graph

Published:1995 Issue: Volume: Page:21-30
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Feng Qing -Wen,Cohen Robert F.,Eades Peter

Publisher

Springer Berlin Heidelberg

Link

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

Reference20 articles.

1. G. Di Battista, P. Eades, and R. Tamassia. Algorithms for drawing graphs: an annotated bibliography. Technical report, Department of Computer Science, Brown University, 1993. To appear in Computational Geometry and Applications.

2. G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry disdplay of planar upward drawings. Discrete & Computational Geometry, 7:381–401, 1992.

3. Claude Berge. Hypergraphs. North-Holland, 1989.

4. H. de Fraysseiz, J. Pach, and R. Pollack. Small sets supporting fary embeddings of planar graphs. In Proc. 20th ACM Symposium on Theory of Computing, pages 426–433, 1988.

5. Qing-Wen Feng, Peter Eades, and Robert F. Cohen. Clustered graphs and cplanarity. Technical Report 04, Department of Computer Science, The University of Newcastle, Australia, 1995.

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

1. Synchronized Planarity with Applications to Constrained Planarity Problems;ACM Transactions on Algorithms;2023-09-26

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

3. Atomic Embeddability, Clustered Planarity, and Thickenability;Journal of the ACM;2022-01-31

4. Crossing minimization in perturbed drawings;Journal of Combinatorial Optimization;2020-06-12

5. Embedding Graphs into Embedded Graphs;Algorithmica;2020-06-11