A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation
Crossref DOI link: https://doi.org/10.1007/s10878-020-00598-w
Published Online: 2020-06-06
Published Print: 2020-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Aurora, Pawan http://orcid.org/0000-0002-1292-8581
Mehta, Shashank K.
Text and Data Mining valid from 2020-06-06
Version of Record valid from 2020-06-06
Article History
First Online: 6 June 2020