Smaller kernels for 3-leaf power modifications problems

A graph G is a 3-leaf power if there is a tree T and a bijective mapping f from V(G) to the set of leaves of T such that (u,v)∈E(G) if and only if the distance in T between f(u) and f(v) is at most 3 for every distinct u,v∈V(G). In the 3-Leaf Power Vertex Deletion (resp., 3-Leaf Power Completion) pr...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1055; s. 115483
Hlavný autor:	Tsur, Dekel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 09.11.2025
Predmet:	Graph algorithms Kernelization Parameterized complexity Parameterized complexity Graph algorithms Kernelization
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!