Publisher
Springer International Publishing
Reference12 articles.
1. Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire lengths in VLSI layouts. Inf. Process. Lett. 25(4), 263–267 (1987). https://doi.org/10.1016/0020-0190(87)90173-6
2. Blažej, V., Fiala, J., Liotta, G.: On the edge-length ratio of 2-trees. CoRR abs/1909.11152 (2019). http://arxiv.org/abs/1909.11152
3. Borrazzo, M., Frati, F.: On the planar edge-length ratio of planar graphs. JoCG 11(1), 137–155 (2020). https://journals.carleton.ca/jocg/index.php/jocg/article/view/470
4. Cabello, S., Demaine, E.D., Rote, G.: Planar embeddings of graphs with specified edge lengths. J. Graph Algorithms Appl. 11(1), 259–276 (2007). https://doi.org/10.7155/jgaa.00145
5. Chen, J., Jiang, A., Kanj, I.A., Xia, G., Zhang, F.: Separability and topology control of quasi unit disk graphs. Wirel. Netw. 17(1), 53–67 (2011). https://doi.org/10.1007/s11276-010-0264-0
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献