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

Bibliographic Details
Title: Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs
Authors: Hellmuth, MarcAff9, Scholz, Guillaume E.Aff10
Contributors: Goos, Gerhard, Founding EditorAff1, Hartmanis, Juris, Founding EditorAff2, Bertino, Elisa, Editorial Board MemberAff3, Gao, Wen, Editorial Board MemberAff4, Steffen, Bernhard, Editorial Board MemberAff5, Yung, Moti, Editorial Board MemberAff6, Wu, Weili, editorAff7, Tong, Guangmo, editorAff8
Source: Computing and Combinatorics : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I. 14422:115-126
Database: Springer Nature eBooks
Description
ISBN:9783031491894
9783031491900
DOI:10.1007/978-3-031-49190-0_8