Author:
Asgharian Sardroud Asghar,Bagheri Alireza
Funder
Amirkabir University of Technology
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems,Theoretical Computer Science,Software
Reference26 articles.
1. Arkin EM, Bender MA, Demaine ED, Fekete SP, Mitchell JSB, Sethia S (2001) Optimal covering tours with turn costs. In: Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 138–147
2. Arkin EM, Fekete SP, Mitchell JSB (2000) Approximation algorithms for lawn mowing and milling. Comput Geom 17(1–2):25–50
3. Cornelsen S, Wagner T (2004) Drawing graphs on two and three lines. J Graph Algorithms Appl 8(2):161–177
4. Diestel R (2010) Graph theory. Graduate texts in mathematics, 4th edn, vol 173. Springer, Heidelberg
5. Dong Chen S, Shen H, Topor R (2002) An efficient algorithm for constructing Hamiltonian paths in meshes. Parallel Comput 28(9):1293–1305
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Unit-length Rectangular Drawings of Graphs;Lecture Notes in Computer Science;2023