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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník 27:2; číslo Discrete Algorithms
Hlavní autori:	Dumas, Maël, Perez, Anthony, Rocton, Mathis, Todinca, Ioan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	DMTCS 01.05.2025 Discrete Mathematics & Theoretical Computer Science
Predmet:	Computer Science computer science - computational complexity computer science - data structures and algorithms Data Structures and Algorithms
ISSN:	1365-8050, 1462-7264, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!