Finding graph embeddings by incremental low-rank semidefinite programming

From MaRDI portal
Publication:3458829

DOI10.1080/10556788.2015.1014553zbMath1332.05100OpenAlexW2028114726MaRDI QIDQ3458829

Seppo Pulkkinen

Publication date: 28 December 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2015.1014553






Cites Work


This page was built for publication: Finding graph embeddings by incremental low-rank semidefinite programming