"On the complexity of and algorithms for finding the shortest path with a ..."

Dahai Xu et al. (2006)

> Home

Details and statistics

DOI: 10.1145/1133553.1133565

access: closed

type: Journal Article

metadata version: 2006-08-22

- view
  - electronic edition @ acm.org
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ton/XuCXQH06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ton/XuCXQH06
Dahai Xu, Yang Chen, Yizhi Xiong, Chunming Qiao, Xin He:
On the complexity of and algorithms for finding the shortest path with a disjoint counterpart. IEEE/ACM Trans. Netw. 14(1): 147-158 (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.