Algorithms for deletion problems on split graphs

被引：0
|
作者：
Tsur, Dekel [1 ]
机构：
[1] Ben Gurion Univ Negev, Beer Sheva, Israel
来源：
INFORMATION PROCESSING LETTERS | 2021年 / 167卷
关键词：
Graph algorithms; Parameterized complexity; Split graphs;
D O I：
10.1016/j.ipl.2020.106066
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In the SPLIT TO BLOCK VERTEX DELETION and SPLIT TO THRESHOLD VERTEX DELETION problems the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of vertices of size at most k such that G - S is a block graph and G - S is a threshold graph, respectively. In this paper we give algorithms for these problems whose running times are O*(2.076(k)) and O*(1.619(k)), respectively. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数：3
相关论文
共 50 条
  • [1] Faster Parameterized Algorithms for Deletion to Split Graphs
    Ghosh, Esha
    Kolay, Sudeshna
    Kumar, Mrinal
    Misra, Pranabendu
    Panolan, Fahad
    Rai, Ashutosh
    Ramanujan, M. S.
    [J]. ALGORITHMICA, 2015, 71 (04) : 989 - 1006
  • [2] Faster Parameterized Algorithms for Deletion to Split Graphs
    Esha Ghosh
    Sudeshna Kolay
    Mrinal Kumar
    Pranabendu Misra
    Fahad Panolan
    Ashutosh Rai
    M. S. Ramanujan
    [J]. Algorithmica, 2015, 71 : 989 - 1006
  • [3] POLYNOMIAL ALGORITHMS FOR THE WEIGHTED PERFECT DOMINATION PROBLEMS ON CHORDAL GRAPHS AND SPLIT GRAPHS
    CHANG, MS
    LIU, YC
    [J]. INFORMATION PROCESSING LETTERS, 1993, 48 (04) : 205 - 210
  • [4] Cluster Deletion on Interval Graphs and Split Related Graphs
    Athanasios L. Konstantinidis
    Charis Papadopoulos
    [J]. Algorithmica, 2021, 83 : 2018 - 2046
  • [5] Cluster Deletion on Interval Graphs and Split Related Graphs
    Konstantinidis, Athanasios L.
    Papadopoulos, Charis
    [J]. ALGORITHMICA, 2021, 83 (07) : 2018 - 2046
  • [6] Problem kernels for NP-complete edge deletion problems: Split and related graphs
    Guo, Jiong
    [J]. ALGORITHMS AND COMPUTATION, 2007, 4835 : 915 - 926
  • [7] Fully Dynamic Algorithms for Chordal Graphs and Split Graphs
    Ibarra, Louis
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2008, 4 (04)
  • [8] Algorithms for unipolar and generalized split graphs
    Eschen, Elaine M.
    Wang, Xiaoqiang
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 162 : 195 - 201
  • [9] Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
    Kumar, Mrinal
    Mishra, Sounaka
    Devi, N. Safina
    Saurabh, Saket
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 526 : 90 - 96
  • [10] Vertex deletion problems on chordal graphs
    Cao, Yixin
    Ke, Yuping
    Otachi, Yota
    You, Jie
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 745 : 75 - 86
12345