Publisher
Springer International Publishing
Reference12 articles.
1. Basagni, S., Bruschi, D., Ravasio, S.: On the difficulty of finding walks of length $$k$$. Theoret. Inform. Appl. 31(5), 429–435 (1997)
2. Bhandari, R.: Survivable Networks. Kluwer Academic Publishers, Dordrecht (1999)
3. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
4. Davie, A., Stothers, A.: Improved bound for complexity of matrix multiplication. Proc. Roy. Soc. Edinb. 143(2), 351–369 (2013)
5. Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献