Parameterized algorithms for the happy set problem

Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we introduce the Maximum Happy Set problem (MaxHS) and study its parameterized complexity: 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; and otherwise unhappy. Given an undirected graph G = (V,E) and an integer k, the goal of MaxHS is to find a subset S ⊆ V of k vertices such that the number of happy vertices is maximized. In this paper we first show that MaxHS is W[1]-hard when parameterized by k. Then, we prove the fixed-parameter tractability of MaxHS when parameterized by the tree-width, the clique-width and k, the neighborhood diversity, or the twin-cover number.

Original languageEnglish
Title of host publicationWALCOM
Subtitle of host publicationAlgorithms and Computation - 14th International Conference, WALCOM 2020, Proceedings
EditorsM. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung
PublisherSpringer
Pages323-328
Number of pages6
ISBN (Print)9783030398804
DOIs
Publication statusPublished - Jan 1 2020
Event14th International Conference and Workshops on Algorithms and Computation, WALCOM 2020 - Singapore, Singapore
Duration: Mar 31 2020Apr 2 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12049 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference and Workshops on Algorithms and Computation, WALCOM 2020
CountrySingapore
CitySingapore
Period3/31/204/2/20

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Parameterized algorithms for the happy set problem'. Together they form a unique fingerprint.

  • Cite this

    Asahiro, Y., Eto, H., Hanaka, T., Lin, G., Miyano, E., & Terabaru, I. (2020). Parameterized algorithms for the happy set problem. In M. S. Rahman, K. Sadakane, & W-K. Sung (Eds.), WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Proceedings (pp. 323-328). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12049 LNCS). Springer. https://doi.org/10.1007/978-3-030-39881-1_27