Faster algorithms for cograph edge modification problems

Dekel Tsur

doi:10.1016/j.ipl.2020.105946

Faster algorithms for cograph edge modification problems

Dekel Tsur

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

In the COGRAPH DELETION (resp., COGRAPH EDITING) 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 whose removal from G (resp., removal and addition to G) results in a graph that does not contain an induced path with four vertices. In this paper we give algorithms for COGRAPH DELETION and COGRAPH EDITING whose running times are O^⁎(2.303^k) and O^⁎(4.329^k), respectively.

Original language	English
Article number	105946
Journal	Information Processing Letters
Volume	158
DOIs	https://doi.org/10.1016/j.ipl.2020.105946
State	Published - 1 Jun 2020

Keywords

Branching algorithms
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2020.105946

Cite this

@article{f3f6fa7fcb624255bfa5ced78424986a,

title = "Faster algorithms for cograph edge modification problems",

abstract = "In the COGRAPH DELETION (resp., COGRAPH EDITING) 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 whose removal from G (resp., removal and addition to G) results in a graph that does not contain an induced path with four vertices. In this paper we give algorithms for COGRAPH DELETION and COGRAPH EDITING whose running times are O⁎(2.303k) and O⁎(4.329k), respectively.",

keywords = "Branching algorithms, Graph algorithms, Parameterized complexity",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2020",

year = "2020",

month = jun,

day = "1",

doi = "10.1016/j.ipl.2020.105946",

language = "English",

volume = "158",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Faster algorithms for cograph edge modification problems

AU - Tsur, Dekel

PY - 2020/6/1

Y1 - 2020/6/1

N2 - In the COGRAPH DELETION (resp., COGRAPH EDITING) 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 whose removal from G (resp., removal and addition to G) results in a graph that does not contain an induced path with four vertices. In this paper we give algorithms for COGRAPH DELETION and COGRAPH EDITING whose running times are O⁎(2.303k) and O⁎(4.329k), respectively.

AB - In the COGRAPH DELETION (resp., COGRAPH EDITING) 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 whose removal from G (resp., removal and addition to G) results in a graph that does not contain an induced path with four vertices. In this paper we give algorithms for COGRAPH DELETION and COGRAPH EDITING whose running times are O⁎(2.303k) and O⁎(4.329k), respectively.

KW - Branching algorithms

KW - Graph algorithms

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=85082020546&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2020.105946

DO - 10.1016/j.ipl.2020.105946

M3 - Article

AN - SCOPUS:85082020546

SN - 0020-0190

VL - 158

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 105946

ER -

Faster algorithms for cograph edge modification problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this