Assistance and interdiction problems on interval graphs
METADATA ONLY
Loading...
Author / Producer
Date
2023-12-15
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
We introduce a novel framework of graph modifications specific to interval graphs. We study interdiction problems with respect to these graph modifications. Given a list of original intervals, each interval has a replacement interval such that either the replacement contains the original, or the original contains the replacement. The interdictor is allowed to replace up to k original intervals with their replacements. Using this framework we also study the contrary of interdiction problems which we call assistance problems. We study these problems for the independence number, the clique number, shortest paths, and the scattering number. We obtain polynomial time algorithms for most of the studied problems. Via easy reductions, it follows that on interval graphs, the most vital nodes problem with respect to shortest path, independence number and Hamiltonicity can be solved in polynomial time.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
340
Pages / Article No.
153 - 170
Publisher
Elsevier
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Deletion blockers; Interdiction; Interval graphs; Most vital nodes problems; Most vital vertex; Vertex blockers
Organisational unit
03457 - Welzl, Emo (emeritus) / Welzl, Emo (emeritus)