Parameterized algorithms for the Happy Set problem

In this paper we study the parameterized complexity for the Maximum Happy Set problem (MaxHS): For an undirected graph G=(V,E) and a subset S⊆V of vertices, a vertex v is happy if v and all its neighbors are in S; otherwise unhappy. Given an undirected graph G=(V,E) and an integer k, the goal of Max...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 304; s. 32 - 44
Hlavní autori:	Asahiro, Yuichi, Eto, Hiroshi, Hanaka, Tesshu, Lin, Guohui, Miyano, Eiji, Terabaru, Ippei
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 15.12.2021 Elsevier BV
Predmet:	Algorithms Apexes Fixed-parameter tractability Graph parameters Maximum happy set problem Parameterization Parameterized complexity Maximum happy set problem Graph parameters Fixed-parameter tractability Parameterized complexity
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!