"All-pairs shortest paths for unweighted undirected graphs in o(mn) ..."

Timothy M. Chan (2006)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/Chan06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/Chan06
Timothy M. Chan:
All-pairs shortest paths for unweighted undirected graphs in o(mn) time. SODA 2006: 514-523

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.