An algorithm for destroying claws and diamonds.

Dekel Tsur

An algorithm for destroying claws and diamonds.

Department of Computer Science

Research output: Working paper/Preprint › Preprint

Abstract

In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of edges of size at most k such that removing the edges of the set from G results a graph that does not contain an induced claw or diamond. In this paper we give an algorithm for this problem whose running time is O∗(3.562k).

Original language	English
State	Published - 2019

Access to Document

https://dblp.org/rec/journals/corr/abs-1908-07318

Cite this

@techreport{b818f240ee244d1e9b8863f77db99551,

title = "An algorithm for destroying claws and diamonds.",

abstract = "In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of edges of size at most k such that removing the edges of the set from G results a graph that does not contain an induced claw or diamond. In this paper we give an algorithm for this problem whose running time is O∗(3.562k). ",

author = "Dekel Tsur",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2019",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - An algorithm for destroying claws and diamonds.

AU - Tsur, Dekel

N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.

PY - 2019

Y1 - 2019

N2 - In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of edges of size at most k such that removing the edges of the set from G results a graph that does not contain an induced claw or diamond. In this paper we give an algorithm for this problem whose running time is O∗(3.562k).

AB - In the {Claw,Diamond}-Free Edge Deletion problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of edges of size at most k such that removing the edges of the set from G results a graph that does not contain an induced claw or diamond. In this paper we give an algorithm for this problem whose running time is O∗(3.562k).

M3 - Preprint

BT - An algorithm for destroying claws and diamonds.

ER -

An algorithm for destroying claws and diamonds.

Abstract

Access to Document

Fingerprint

Cite this