|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6357
| Title: | Graph Rigidity |
| Authors: | Cole, Richard |
| Keywords: | computer science
technical report |
| Issue Date: | Aug-1982 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-517 |
| 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. |
| URI: | http://hdl.handle.net/1813/6357 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
