Eigenvector synchronization, graph rigidity and the molecule problem

DOI10.1093/imaiai/ias002zbMath1278.05231arXiv1111.3304WikidataQ37467373 ScholiaQ37467373MaRDI QIDQ2869799

Amit Singer, Mihai Cucuringu, David Cowburn

Publication date: 6 January 2014

Published in: Information and Inference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.3304

zbMATH Keywords

eigenvectors; distance geometry; synchronization; spectral graph theory; SDP; divide and conquer; graph realization; rigidity theory; the molecule problem

Mathematics Subject Classification ID

05C90: Applications of graph theory

90C22: Semidefinite programming

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Uses Software

• DISCO