Happy set problem on subclasses of co-comparability graphs
From MaRDI portal
Publication:2154092
DOI10.1007/978-3-030-96731-4_13OpenAlexW4225961400MaRDI QIDQ2154092
Takehiro Ito, Akira Suzuki, Hiroshi Eto, Yuma Tamura, Eiji Miyano
Publication date: 13 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_13
Related Items (2)
Corrigendum to: ``Complexity and approximability of the happy set problem ⋮ Happy set problem on subclasses of co-comparability graphs
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
- Complexity and approximability of the happy set problem
- The LBFS Structure and Recognition of Interval Graphs
- Domination on Cocomparability Graphs
- Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs
- 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
