Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs."

Longkun Guo, Hong Shen (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-21204-8_32

access: closed

type: Conference or Workshop Paper

metadata version: 2018-06-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/aaim/GuoS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaim/GuoS11
Longkun Guo, Hong Shen:
Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs. FAW-AAIM 2011: 300-307

a service of

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.