Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

Chan, Wun-Tat and Chin, Francis Y. L. (2000) Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids. Journal of Algorithms, 34 (2). pp. 337-369.

Full text not available from this repository.

Item Type:	Article
Subjects:	UNSPECIFIED
ID Code:	186
Deposited By:	Dr Joseph Wun-Tat Chan
Deposited On:	31 Oct 2007 18:01
Last Modified:	01 Nov 2007 17:55

Repository Staff Only: item control page

Accessibility | Terms and Conditions | Last Modified 01 November 2007