Zig-Zag Numberlink is NP-Complete
When can t terminal pairs in an m × n grid be connected by t vertex-disjoint paths that cover all vertices of the grid? We prove that this problem is NP-complete. Our hardness result can be compared to two previous NP-hardness proofs: Lynch's 1975 proof without the "cover all vertices"...
| Main Authors: | , , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Information Processing Society of Japan,
2015-11-23T17:47:19Z.
|
| Subjects: | |
| Online Access: | Get fulltext |