Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths."

Longkun Guo et al. (2018)

> Home

Details and statistics

DOI: 10.24963/IJCAI.2018/202

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/ijcai/GuoDLHSH18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/GuoDLHSH18
Longkun Guo, Yunyun Deng, Kewen Liao, Qiang He, Timos Sellis, Zheshan Hu:
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths. IJCAI 2018: 1456-1462

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.