Happy Set Problem on Subclasses of Co-comparability Graphs

• Published in: Algorithmica Vol. 85; no. 11; pp. 3327 - 3347
• Main Authors: Eto, Hiroshi, Ito, Takehiro, Miyano, Eiji, Suzuki, Akira, Tamura, Yuma
• Format: Journal Article
• Language: English
• Published: New York Springer US 2023; Springer Nature B.V
• Subjects: Algorithm Analysis and Problem Complexity; Algorithms; Apexes; Computer Science; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Graphs; Mathematics of Computing; Permutations; Theory of Computation; Interval graphs; Permutation graphs; trapezoid graphs; Graph algorithm; Co-comparability graphs; Happy set problem

In this paper, we investigate the complexity of the Maximum Happy Set problem on subclasses of co-comparability graphs. For a graph G and its vertex subset S , a vertex v ∈ S is happy if all v ’s neighbors in G are contained in S . Given a graph G and a non-negative integer k , Maximum Happy Set is...