A direct linear-time planarity test for unflippable modules

DOI10.1080/00207168708803570zbMath0656.68072OpenAlexW2126412363MaRDI QIDQ3804209

Amihood Amir

Publication date: 1987

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168708803570

zbMATH Keywords

modulesriver routingterminalsintegrated circuit layoutgraph planar embeddingplanar routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• Computing an st-numbering
• Optimal Placement for River Routing
• Efficient Planarity Testing

This page was built for publication: A direct linear-time planarity test for unflippable modules