Year-end Sale % OFF 
Abstract
The notions of the distance and multidistance embeddability of a graph in ℝd are natural generalizations of the notion of a distance graph in ℝd. Results on the complexity of the computational problem of verifying distance graph embeddability are briefly surveyed, and new progress in solving this and related problems is described.
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.
