Polynomial kernels for edge modification problems towards block and strictly chordal graphs

We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a block graph or a strictly chordal graph. The completion and...

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. 27:2; no. Discrete Algorithms
Main Authors:	Dumas, Maël, Perez, Anthony, Rocton, Mathis, Todinca, Ioan
Format:	Journal Article
Language:	English
Published:	DMTCS 01.05.2025 Discrete Mathematics & Theoretical Computer Science
Subjects:	Computer Science computer science - computational complexity computer science - data structures and algorithms Data Structures and Algorithms
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!