scientific article; zbMATH DE number 1737512

MaRDI QIDQ4529630zbMATH OpenFDO

Authors Miklós Attila Lengyel

Publication date 5 May 2002

zbMATH Keywords

upper boundlinear-time algorithmchannel routingVLSI routing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• scientific article; zbMATH DE number 3907789
• Optimal Three-Layer Channel Routing
• An algorithm for routing problems with given horizontal constraint graph
• scientific article; zbMATH DE number 4077133
• scientific article; zbMATH DE number 6538149

Cited in

(7)

• scientific article; zbMATH DE number 6538149 (Why is no real title available?)
• scientific article; zbMATH DE number 3967925 (Why is no real title available?)
• Minimum separation for single-layer channel routing
• An efficient parallel logarithmic time algorithm for the channel routing problem
• Routing through a Dense Channel with Minimum Total Wire Length
• Maximum alignment of interchangeable terminals
• An algorithm for routing problems with given horizontal constraint graph

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 Q4529630)