Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations-Reference-Cited by-同舟云学术

Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations

Published:2013 Issue: Volume: Page:376-387
ISSN:0302-9743
Container-title:Graph Drawing
language:
Short-container-title:

Author:

Chan Timothy M.,Hoffmann Hella-Franziska,Kiazyk Stephen,Lubiw Anna

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-03841-4_33

Reference24 articles.

1. Pach, J., Wenger, R.: Embedding planar graphs at fixed vertex locations. Graphs and Combinatorics 17(4), 717–728 (2001)

2. Sam Loyd, J.: Sam Loyd’s Cyclopedia of 5000 Puzzles Tricks and Conundrums. Lamb Publishing Company (1914)

3. Angelini, P., Di Battista, G., Frati, F., Jelínek, V., Kratochvíl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 202–221 (2010)

4. Liebling, T.M., Margot, F., Müller, D., Prodon, A., Stauffer, L.: Disjoint paths in the plane. ORSA Journal on Computing 7(1), 84–88 (1995)

5. Bastert, O., Fekete, S.P.: Geometric wire routing. Technical Report 332, Angewandte Mathematik und Informatik, Universität zu Köln (1996) (in German)

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

1. A New Algorithm for Embedding Plane Graphs at Fixed Vertex Locations;The Electronic Journal of Combinatorics;2021-12-10

2. Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures;Quantum Information Processing;2019-01-12

3. PlanarONoC;Proceedings of the 55th Annual Design Automation Conference;2018-06-24

4. Alternating paths and cycles of minimum length;Computational Geometry;2016-10

5. Multi-sided Boundary Labeling;Algorithmica;2015-07-21