"Improved algorithms for finding length-bounded two vertex-disjoint paths ..."

Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang (2010)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2010.01.013

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/YuLW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/YuLW10
Chih-Chiang Yu, Chien-Hsin Lin, Biing-Feng Wang:
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph. J. Comput. Syst. Sci. 76(8): 697-708 (2010)

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.