Complexity of Recognizing Multidistance Graphs in $$\mathbb{R}^d$$
Crossref DOI link: https://doi.org/10.1134/S000143462405016X
Published Online: 2024-07-15
Published Print: 2024-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Sokolov, G. M.
Text and Data Mining valid from 2024-06-01
Version of Record valid from 2024-06-01
Article History
Received: 12 August 2023
Revised: 25 September 2023
Accepted: 15 December 2023
First Online: 15 July 2024
Conflict of interest
: The author of this work declares that he has no conflicts of interest.