An efficient parallel logarithmic time algorithm for the channel routing problem

DOI10.1016/0166-218X(92)90022-3zbMath0785.68048MaRDI QIDQ1201820

S. Singh

Publication date: 17 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsknock-knee modetwo-terminal net channel routing

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Distributed algorithms (68W15)

Cites Work

• Disjoint paths in a rectilinear grid
• An introduction to parallelism in combinatorial optimization
• Parallel Algorithms for Channel Routing in the Knock-Knee Model
• Binary Trees and Parallel Scheduling Algorithms
• Optimal Three-Layer Channel Routing
• Parallelism in random access machines

This page was built for publication: An efficient parallel logarithmic time algorithm for the channel routing problem