Graph Rigidity

Thumbnail
View/Open
PERMANENT LINK(S)
https://hdl.handle.net/1813/6357
Collections
Metadata
Show full item record
Author
Cole, Richard
Abstract
The relationship between graph isomorphism and graph rigidity is studied. Although in general it is not known if these problems are equivalent under polynomial time Turing reductions, equivalence is shown for a subclass of graphs with abelian automorphism groups.
Date Issued
1982-08
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-517
Type
technical report

Statistics