Paper by Erik D. Demaine

Reference:

Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Roderick Kimball, and Justin Kopinsky, “Path Puzzles: Discrete Tomography with a Path Constraint is Hard”, Graphs and Combinatorics, volume 36, 2020, pages 251–267.

BibTeX

@Article{PathPuzzles_GC,
  AUTHOR        = {Jeffrey Bosboom and Erik D. Demaine and Martin L. Demaine and Adam Hesterberg and Roderick Kimball and Justin Kopinsky},
  TITLE         = {Path Puzzles: Discrete Tomography with a Path Constraint is Hard},
  JOURNAL       = {Graphs and Combinatorics},
  journalurl    = {http://www.springer.com/mathematics/numbers/journal/373},
  VOLUME        = 36,
  YEAR          = 2020,
  PAGES         = {251--267},

  length        = {16 pages},
  withstudent   = 1,
  dblp          = {https://dblp.org/rec/journals/gc/BosboomDDHKK20},
  comments      = {This paper is available as <A HREF="https://arxiv.org/abs/1803.01176">arXiv:1803.01176</A> and from <A HREF="https://doi.org/10.1007/s00373-019-02092-5">SpringerLink</A>.},
  replaces      = {PathPuzzles_JCDCGGG2017},
  papers        = {PathPuzzles_JCDCGGG2017},
  webpages      = {fonts/pathpuzzles},
}

Abstract:

We prove that path puzzles with complete row and column information—or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint—are strongly NP-complete, ASP-complete, and #P-complete. Along the way, we newly establish ASP-completeness and #P-completeness for 3-Dimensional Matching and Numerical 3-Dimensional Matching.

Comments:

This paper is available as arXiv:1803.01176 and from SpringerLink.

Length:

The paper is 16 pages.

Availability:

The paper is available in PDF (716k).

See information on file formats.

[Google Scholar search]

Related papers:

PathPuzzles_JCDCGGG2017 (Path Puzzles: Discrete Tomography with a Path Constraint is Hard)

Related webpages:

Path Puzzles Font