Escaping a grid by edge-disjoint paths

DOI10.1007/s00453-003-1023-8zbMath1046.68131OpenAlexW3137227903MaRDI QIDQ1402223

Hing-Fung Ting, Wun-Tat Chan, Francis Y. L. Chin

Publication date: 19 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/45612

zbMATH Keywords

Design and analysis of algorithmGraph algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Linkage on the infinite grid ⋮ Solving the edge‐disjoint paths problem using a two‐stage method ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses ⋮ On path-pairability of the finite grids ⋮ Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid ⋮ Path-pairability of infinite planar grids

This page was built for publication: Escaping a grid by edge-disjoint paths