Recognizing geometric intersection graphs stabbed by a line

Chakraborty, D. orcid.org/0000-0003-0534-6417, Gajjar, K. and Rusu, I. (2024) Recognizing geometric intersection graphs stabbed by a line. Theoretical Computer Science, 995. 114488. ISSN 0304-3975

Abstract

Metadata

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

© 2024 Elsevier B.V. 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: Intersection graph, Grounded L-graph, Stabbable grid intersection graph, Complexity, NP-completeness
Dates:
  • Published: 12 March 2024
  • Published (online): 6 March 2024
  • Accepted: 29 February 2024
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: 08 Mar 2024 15:26
Last Modified: 06 Mar 2025 01:13
Status: Published
Publisher: Elsevier
Identification Number: 10.1016/j.tcs.2024.114488
Open Archives Initiative ID (OAI ID):

Export

Statistics