scientific article; zbMATH DE number 1445371

MaRDI QIDQ4952693zbMATH OpenFDO

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

Publication date 10 May 2000

zbMATH Keywords

edge-disjoint escape problempackage routingVLSI reconfiguration

Mathematics Subject Classification ID

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

Recommendations

• Escaping a grid by edge-disjoint paths
• Edge-disjoint paths in a grid bounded by two nested rectangles
• Finding paths in grids with forbidden transitions
• scientific article; zbMATH DE number 1629971
• scientific article; zbMATH DE number 2079393
• Edge-disjoint paths revisited
• Edge-intersection graphs of boundary-generated paths in a grid
• Edge-disjoint paths in planar graphs
• On approximating node-disjoint paths in grids
• scientific article; zbMATH DE number 7272507

Cited in

(4)

• Escaping a grid by edge-disjoint paths
• On the rectangle escape problem
• Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
• Edge-disjoint paths in a grid bounded by two nested rectangles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4952693)