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.

Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs

Ran Duan, Yong Gu, Le Zhang. Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs. In Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, Donald Sannella, editors, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic. Volume 107 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Authors

Ran Duan

This author has not been identified. Look up 'Ran Duan' in Google

Yong Gu

This author has not been identified. Look up 'Yong Gu' in Google

Le Zhang

This author has not been identified. Look up 'Le Zhang' in Google
runs on