eCommons

 

Conditions Unique Graph Embeddings

Other Titles

Abstract

The graph embedding problem is that of computing the relative locations of a set of vertices placed in Euclidean space relying only upon some set of inter-vertex distance measurements. This paper is concerned with the closely related problem of determining whether or not a graph has a unique embedding. Both these problems are NP-hard, but the proofs rely upon special combinations of edge lengths. If we assume the edge lengths are unrelated then the uniqueness question can be approached from a purely graph theoretic framework that ignores edge lenghts. This paper identifies three necessary graph theoretic conditions for a graph to have a unique embedding in any dimension. Efficient sequential and NC algorithms are presented for each condition, although these algorithms have very different flavors in different dimensions.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1988-11

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-950

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record