Abstract
Let A be a set of positive numbers. A graph G is called an A-embeddable graph in Rd if the vertices of G can be positioned in Rd so that the distance between endpoints of any edge is an element of A. We consider the computational problem of recognizing A-embeddable graphs in R1 and classify all finite sets A by complexity of this problem in several natural variations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
