Finding geometric representations of apex graphs is NP-hard

Chakraborty, D. orcid.org/0000-0003-0534-6417 and Gajjar, K. (Cover date: 6 September 2023) Finding geometric representations of apex graphs is NP-hard. Theoretical Computer Science, 971. 114064. ISSN 0304-3975

Abstract

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2023, Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/. This is an author produced version of an article published in Theoretical Computer Science. Uploaded in accordance with the publisher's self-archiving policy.

Keywords: Hamiltonian path; Planar graph; Apex graph; NP-hard; Recognition problem; Geometric intersection graph; VLSI design; 1-STRING; PURE-2-DIR
Dates:
  • Published: 6 September 2023
  • Published (online): 11 July 2023
  • Accepted: 4 July 2023
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 05 Oct 2023 15:07
Last Modified: 11 Jul 2024 00:13
Published Version: https://www.sciencedirect.com/science/article/pii/...
Status: Published
Publisher: Elsevier BV
Identification Number: 10.1016/j.tcs.2023.114064
Open Archives Initiative ID (OAI ID):

Export

Statistics