Chih-Chiang Yu et al.: 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. (2010)
10.1016/j.jcss.2010.01.013
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.
3
697-708
J. Comput. Syst. Sci.
J. Comput. Syst. Sci.
76
8
2010
provenance information for RDF data of dblp record 'journals/jcss/YuLW10'
2021-02-16T14:03:57+0100