External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Maximum Disjoint Routing Problem

Farhad Shahmohammadi, Amir Sharif-Zadeh, Hamid Zarrabi-Zadeh. The Maximum Disjoint Routing Problem. In Thang N. Dinh, My T. Thai, editors, Computing and Combinatorics - 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings. Volume 9797 of Lecture Notes in Computer Science, pages 319-329, Springer, 2016. [doi]

Authors

Farhad Shahmohammadi

This author has not been identified. Look up 'Farhad Shahmohammadi' in Google

Amir Sharif-Zadeh

This author has not been identified. Look up 'Amir Sharif-Zadeh' in Google

Hamid Zarrabi-Zadeh

This author has not been identified. Look up 'Hamid Zarrabi-Zadeh' in Google
runs on