Back to Results
First PageMeta Content
Forbidden graph characterization / Configurations / Planar graphs / Graph coloring / Möbius–Kantor graph / Graph theory / Robertson–Seymour theorem / Bipartite graph


First Section Flavors of Rigidity Flavor IV - Reconstructing Discrete Networks University of Pittsburgh
Add to Reading List

Document Date: 2015-01-22 09:08:15


Open Document

File Size: 447,37 KB

Share Result on Facebook

Facility

Reconstructing Discrete Networks University of Pittsburgh Bob Connelly Cornell University October / /

IndustryTerm

energy minimization / polynomial-time algorithm / /

Organization

Cornell University / University of Pittsburgh / /

Person

Abbie Ho↵man / Bruce Hendrickson / /

Technology

SDP algorithm / polynomial-time algorithm / /

SocialTag