Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids (Q4943081)
From MaRDI portal
scientific article; zbMATH DE number 1415605
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids |
scientific article; zbMATH DE number 1415605 |
Statements
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids (English)
0 references
28 August 2000
0 references
disjoint paths
0 references
