Tsunehiko Nagayama

According to our database1, Tsunehiko Nagayama authored at least 2 papers between 2018 and 2019.

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

2019
Faster algorithms for shortest path and network flow based on graph decomposition.
J. Graph Algorithms Appl., 2019

2018
Faster Network Algorithms Based on Graph Decomposition.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018


  Loading...