Complexity of Single-Layer Routing

  • Authors:

  • D. Richards

  • Affiliations:

  • Department of Computer and Information Science, Indiana University-Purdue University

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1984

Quantified Score

Hi-index 14.98

Visualization

Abstract

The problem of routing wires between pairs of terminals over a two-dimensional grid is shown to be NP-complete. Actually, the stronger result of routing over any planar graph with no vertex having degree greater than 3 is shown to be NP-complete.