Publication | Closed Access

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

EngineeringGraph TheoryGeometric AlgorithmCombinatory AnalysisCombinatorial ProblemComputational ComplexityEnumerative CombinatoricsComputer ScienceDisjoint PathsDiscrete MathematicsCombinatorial OptimizationComputational GeometryEfficient AlgorithmsMaximum NumberGrid Network