Happy set problem on subclasses of co-comparability graphs

DOI10.1007/s00453-022-01081-0MaRDI QIDQ6069926

Yuma Tamura, Takehiro Ito, Hiroshi Eto, Akira Suzuki, Eiji Miyano

Publication date: 17 November 2023

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

graph algorithminterval graphspermutation graphs\(d\)-trapezoid graphsco-comparability graphshappy set problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Algorithmic aspects of homophyly of networks
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Modular decomposition and transitive orientation
• Happy set problem on subclasses of co-comparability graphs
• Complexity and approximability of the happy set problem
• The LBFS Structure and Recognition of Interval Graphs
• Domination on Cocomparability Graphs
• The Complexity of the Partial Order Dimension Problem
• Treewidth and Minimum Fill-in on d-Trapezoid Graphs
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
• On the 2-Chain Subgraph Cover and Related Problems
• Feedback vertex set on cocomparability graphs
• Parameterized algorithms for the happy set problem
• The dense \(k\)-subgraph problem

This page was built for publication: Happy set problem on subclasses of co-comparability graphs