Planar Polyline Drawings via Graph Transformations-Reference-Cited by-同舟云学术

Planar Polyline Drawings via Graph Transformations

Published:2008-08-15 Issue:2 Volume:57 Page:381-397
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Zhang Huaming

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-008-9215-x.pdf

Reference15 articles.

1. di Battista, G., Eades, P., Tammassia, R., Tollis, I.: Graph Drawing: Algorithms for the Visualization of Graphs. Princeton Hall, Princeton (1998)

2. Lecture Notes in Computer Science;N. Bonichon,2002

3. Lecture Notes in Computer Science;N. Bonichon,2003

4. Bonichon, N., Gavoille, C., Hanusse, N.: An information-theoretic upper bound of planar graphs using triangulation. Research Report RR-1279-02, LaBRI, University of Bordeaux, France

5. Bonichon, N., Gavoille, C., Hanusse, N.: Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. J. Graph Algorithms Appl. 9, 185–204 (2005)

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

1. Dushnik-Miller dimension of contact systems of d-dimensional boxes;Electronic Notes in Discrete Mathematics;2017-08

2. Trade-Offs in Planar Polyline Drawings;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2014

3. Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area;Thirty Essays on Geometric Graph Theory;2012-10-29

4. Improved floor-planning of graphs via adjacency-preserving transformations;Journal of Combinatorial Optimization;2010-04-24