Lupa

Show document Help

A- | A+ | Print
Title:On the proper interval completion problem within some chordal subclasses
Authors:ID Dross, François (Author)
ID Hilaire, Claire (Author)
ID Koch, Ivo (Author)
ID Leoni, Valeria Alejandra (Author)
ID Pardal, Nina (Author)
ID Lopez Pujato, María Inés (Author)
ID Fernandes dos Santos, Vinicius (Author)
Files:.pdf RAZ_Dross_Francois_2025.pdf (824,75 KB)
MD5: 5C5BFD7A9C8D8F83829B6108263FAF36
 
URL https://doi.org/10.1016/j.disc.2024.114274
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:FAMNIT - Faculty of Mathematics, Science and Information Technologies
Abstract:Given a property (graph class) Π, a graph G, and an integer k, the Π-completion problem consists of deciding whether we can turn G into a graph with the property Π by adding at most k edges to G. The Π-completion problem is known to be NP-hard for general graphs when Π is the property of being a proper interval graph (PIG). In this work, we study the PIG-completion problem within different subclasses of chordal graphs. We show that the problem remains NP-complete even when restricted to split graphs. We then turn our attention to positive results and present polynomial time algorithms to solve the PIG-completion problem when the input is restricted to caterpillar and threshold graphs. We also present an efficient algorithm for the minimum co-bipartite-completion for quasi-threshold graphs, which provides a lower bound for the PIG-completion problem within this graph class.
Keywords:proper interval completion, split graph, threshold graph, quasi-threshold graph, caterpillar
Publication date:07.10.2024
Year of publishing:2025
Number of pages:str. 1-15
Numbering:Vol. 348, iss. 1, [article no.] 114274
PID:20.500.12556/RUP-21529 This link opens in a new window
UDC:519.17
ISSN on article:0012-365X
DOI:10.1016/j.disc.2024.114274 This link opens in a new window
COBISS.SI-ID:218515203 This link opens in a new window
Publication date in RUP:06.08.2025
Views:390
Downloads:6
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discrete mathematics
Shortened title:Discrete math.
Publisher:North-Holland
ISSN:0012-365X
COBISS.SI-ID:1118479 This link opens in a new window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-4008-2022
Name:Drevesno neodvisnostno število grafov

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:pravilno dokončanje intervala, razdeljeni graf, graf praga, graf kvazipraga, caterpillar


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica