A survey and evaluation of graph realization algorithms

DOI10.16383/J.AAS.2018.C170561zbMATH Open1463.05523WikidataQ118421301 ScholiaQ118421301MaRDI QIDQ5129249FDOQ5129249

Authors: Tianyuan Sun, Yongcai Wang, Deying Li 

Publication date: 27 October 2020

Recommendations

• Eigenvector synchronization, graph rigidity and the molecule problem
• Formal theory of noisy sensor network localization
• Distributed Graph Layout for Sensor Networks
• Graph Drawing
• Conditions for Unique Graph Realizations

zbMATH Keywords

global optimizationnetwork localizationglobal rigiditygraph realizationcomponent stitching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10)

Cited In (1)

• Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks

This page was built for publication: A survey and evaluation of graph realization algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129249)