Single bend wiring

DOI10.1016/0196-6774(86)90006-4MaRDI QIDQ3745779zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Raghunath Raghavan, James P. Cohoon, Sartaj Sahni

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90006-4

zbMATH Keywords

wire layoutwire routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Single bend wiring on surfaces
• scientific article; zbMATH DE number 4185548
• River Routing with a Small Number of Jogs
• The complexity of single row routing
• One-layer routing without component constraints

Cited in

(11)

• Representations of graphs and networks (coding, layouts and embeddings)
• Theoretical results on at most 1-bend embeddability of graphs
• Single bend wiring on surfaces
• On-line 2-satisfiability
• Schematization of networks
• Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
• A multistage view on 2-satisfiability
• Edge intersection graphs of single bend paths on a grid
• Multi-sided boundary labeling
• Geometric graphs in the plane lattice
• The Graham-Knowlton problem revisited

This page was built for publication: Single bend wiring

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