Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
From MaRDI portal
Publication:4943081
DOI10.1006/jagm.1999.1054zbMath0949.68171OpenAlexW2059818291MaRDI QIDQ4943081
Wun-Tat Chan, Francis Y. L. Chin
Publication date: 28 August 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1999.1054
Related Items (4)
The shortest multipaths problem in a capacitated dense channel ⋮ GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY ⋮ Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs ⋮ The Maximum Disjoint Routing Problem
This page was built for publication: Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
