"On the complexity of vertex-disjoint length-restricted path problems."

Andreas Bley (2003)

> Home

Details and statistics

DOI: 10.1007/S00037-003-0179-6

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/Bley03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/Bley03
Andreas Bley:
On the complexity of vertex-disjoint length-restricted path problems. Comput. Complex. 12(3-4): 131-149 (2003)

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.