External Links

Cite Key

Statistics

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

PDF

Tags

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.

Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations

Bing Yang, S. Q. Zheng. Finding Min-Sum Disjoint Shortest Paths from a Single Source to All Pairs of Destinations. In Jin-yi Cai, S. Barry Cooper, Angsheng Li, editors, Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings. Volume 3959 of Lecture Notes in Computer Science, pages 206-216, Springer, 2006. [doi]

Authors

Bing Yang

This author has not been identified. Look up 'Bing Yang' in Google

S. Q. Zheng

This author has not been identified. Look up 'S. Q. Zheng' in Google
runs on