Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs
Συγγραφείς:	Hellmuth, Marc^Aff9, Scholz, Guillaume E.^Aff10
Συνεισφορές:	Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Wu, Weili, editor^Aff7, Tong, Guangmo, editor^Aff8
Πηγή:	Computing and Combinatorics : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I. 14422:115-126
Βάση Δεδομένων:	Springer Nature eBooks

Περιγραφή
ISBN:	9783031491894 9783031491900
DOI:	10.1007/978-3-031-49190-0_8