Browsing by Author "O'Brien, Michael P."

Now showing items 1-1 of 1

    • Zig-Zag Numberlink is NP-Complete 

      Adcock, Aaron; Reidl, Felix; Demaine, Erik D.; Demaine, Martin L.; O'Brien, Michael P.; e.a. (Information Processing Society of Japan, 2015-05)
      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 ...