Chakraborty, D. orcid.org/0000-0003-0534-6417 and Gajjar, K. (2022) Finding Geometric Representations of Apex Graphs is NP-Hard. In: WALCOM: Algorithms and Computation. 16th International Conference and Workshops, WALCOM 2022, 24-26 Mar 2022, Jember, Indonesia,. Lecture Notes in Computer Science, 13174 . Springer Nature , Cham, Switzerland , pp. 161-174. ISBN 9783030967307
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: https://doi.org/10.1007/978-3-030-96731-4_14 . |
Keywords: | Hamiltonian path, planar graph, apex graph, NP-hard, recognition problem, geometric intersection graph, VLSI design, 1-STRING, PURE-2-DIR |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity |
Depositing User: | Symplectic Publications |
Date Deposited: | 22 Jul 2024 10:43 |
Last Modified: | 22 Jul 2024 10:43 |
Published Version: | https://link.springer.com/chapter/10.1007/978-3-03... |
Status: | Published |
Publisher: | Springer Nature |
Series Name: | Lecture Notes in Computer Science |
Identification Number: | 10.1007/978-3-030-96731-4_14 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:214993 |