Happy set problem on subclasses of co-comparability graphs

DOI10.1007/S00453-022-01081-0MaRDI QIDQ6069926zbMATH OpenFDO

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

Publication date 17 November 2023

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-022-01081-0

zbMATH Keywords

\(d\)-trapezoid graphsco-comparability graphsgraph algorithmhappy set probleminterval graphspermutation graphs

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(2)

• Happy set problems on cubic graphs and convex bipartite graphs
• The bend number of cocomparability graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069926)