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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
