"Logarithmic hardness of the undirected edge-disjoint paths problem."

Matthew Andrews, Lisa Zhang (2006)

> Home

Details and statistics

DOI: 10.1145/1183907.1183910

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/AndrewsZ06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/AndrewsZ06
Matthew Andrews, Lisa Zhang:
Logarithmic hardness of the undirected edge-disjoint paths problem. J. ACM 53(5): 745-761 (2006)

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.