Author:
AliAbdi Amin,Mohades Ali,Davoodi Mansoor
Publisher
Springer Science and Business Media LLC
Subject
Geography, Planning and Development,Information Systems
Reference49 articles.
1. LaValle SM (2006) Planning algorithms. Cambridge University Press, Cambridge
2. Turner L, Hamacher HW (2011) On Universal Shortest Paths. Springer Berlin Heidelberg, pp 313–318
3. Gourvès L, Lyra A, Martinhon C, Monnot J, Protti F (2009) On s-t paths and trails in edge-colored graphs. Electronic Notes in Discrete Mathematics 35:221–226. https://doi.org/10.1016/j.endm.2009.11.037
4. Garey MR, Johnson DS (1979) Computers and intracability: A guide to the theory of NP-completeness. W.H. Freeman, New York, NY, USA
5. Silva R, Craveirinha J (2004) An Overview of routing models for MPLS Networks. In: 1st Workshop Multicriteria Modelling in Telecommunication Network Planning and Design. Faculty of Economics of the University of Coimbra, Coimbra, Portugal, pp 17–24
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献