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.

Efficient Algorithms for Listing k Disjoint st-Paths in Graphs

Roberto Grossi, Andrea Marino, Luca Versari. Efficient Algorithms for Listing k Disjoint st-Paths in Graphs. In Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Volume 10807 of Lecture Notes in Computer Science, pages 544-557, Springer, 2018. [doi]

Authors

Roberto Grossi

This author has not been identified. Look up 'Roberto Grossi' in Google

Andrea Marino

This author has not been identified. Look up 'Andrea Marino' in Google

Luca Versari

This author has not been identified. Look up 'Luca Versari' in Google
runs on