NP-Completeness of the Combinatorial Distance Matrix Realisation Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fairbairn, David L., Mertzios, George B., Peyerimhoff, Norbert
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Complexity Discrete Mathematics F.2.2; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2406.14729