Jul 2026
Point Set Embeddability with List Constraints
This paper studies the more general embeddability question where the placement of each vertex is restricted to a list of admissible points, and shows NP-hardness for bi-labeled paths.
Thomas Depian, Joseph Dorfer, Boris Klemz et al.
· arXiv.org · 0 citations