AI Chat AI Image Generator AI Video Text to Speech

Faster branching algorithm for split to block vertex deletion

06/24/2019

∙

by Dekel Tsur, et al.

∙

∙

In the Split to Block Vertex Deletion (SBVD) problem the input is a split graph G and an integer k, and the goal is to decide whether there is a set S of at most k vertices such that G-S is a block graph. In this paper we give an algorithm for SBVD whose running time is O^*(2.203^k).

page 1

page 2

page 3

page 4

research

∙ 06/24/2019

A note on the Split to Block Vertex Deletion problem

In the Split to Block Vertex Deletion (SBVD) problem the input is a spli...

0 Dekel Tsur, et al. ∙

research

∙ 06/24/2019

Algorithms for deletion problems on split graphs

In the Split to Block Vertex Deletion and Split to Threshold Vertex Dele...

0 Dekel Tsur, et al. ∙

research

∙ 03/20/2023

An Improved Exact Algorithm for Knot-Free Vertex Deletion

A knot K in a directed graph D is a strongly connected component of size...

0 Ajaykrishnan E S, et al. ∙

research

∙ 09/23/2020

A simple (2+ε)-approximation algorithm for Split Vertex Deletion

A split graph is a graph whose vertex set can be partitioned into a cliq...

0 Matthew Drescher, et al. ∙

research

∙ 06/23/2023

On minimum t-claw deletion in split graphs

For t≥ 3, K_1, t is called t-claw. In minimum t-claw deletion problem ()...

0 Sounaka Mishra, et al. ∙

research

∙ 02/28/2023

Parameterized Complexity of Vertex Splitting to Pathwidth at most 1

Motivated by the planarization of 2-layered straight-line drawings, we c...

0 Jakob Baumann, et al. ∙

research

∙ 01/04/2021

Split block Bloom filters

This short note describes a Bloom filter variant that takes advantage of...

0 Jim Apple, et al. ∙