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

✍ Scribed by Chih-Chiang Yu; Chien-Hsin Lin; Biing-Feng Wang

• Book ID: 108166586
• Publisher: Elsevier Science
• Year: 2010
• Tongue: English
• Weight: 323 KB
• Volume: 76
• Category: Article
• ISSN: 0022-0000
• DOI: 10.1016/j.jcss.2010.01.013