Computational Complexity of Combinatorial Distance Matrix Realisation

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	Computational Complexity of Combinatorial Distance Matrix Realisation
Συγγραφείς:	Fairbairn, David L.^Aff10, Mertzios, George B.^Aff11, Peyerimhoff, Norbert^Aff10
Συνεισφορές:	Goos, Gerhard, Series Editor^{Aff1, Aff3}, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff4, Gao, Wen, Editorial Board Member^Aff5, Steffen, Bernhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Finocchi, Irene, editor^Aff8, Georgiadis, Loukas, editor^Aff9
Πηγή:	Algorithms and Complexity : 14th International Conference, CIAC 2025, Rome, Italy, June 10–12, 2025, Proceedings, Part I. 15679:51-67
Βάση Δεδομένων:	Springer Nature eBooks

Περιγραφή
ISBN:	9783031929311 9783031929328
DOI:	10.1007/978-3-031-92932-8_4