Mehrdad Arabpour Niasari

Orcid: 0000-0002-8589-8125

According to our database1, Mehrdad Arabpour Niasari authored at least 1 paper in 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
An Efficient Shortest Path Routing on the Hypercube with Blocking/Faulty Nodes.
Proceedings of the Sixth International Symposium on Computing and Networking, 2018


  Loading...