Journal of Algorithms
The homogeneous set sandwich problem
Information Processing Letters
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An efficient algorithm for solving the homogeneous set sandwich problem
Information Processing Letters
Efficient and practical algorithms for sequential modular decomposition
Journal of Algorithms
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics
A note on finding all homogeneous set sandwiches
Information Processing Letters
On decision and optimization (k, l)-graph sandwich problems
Discrete Applied Mathematics
Note on the homogeneous set sandwich problem
Information Processing Letters
Theoretical Computer Science
Hi-index | 0.89 |
A homogeneous set is a non-trivial module of a graph, i.e., a non-empty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two graphsG1 (V, E1) and G2(V, E2), the Homogeneous Set Sandwich Problem (HSSP) asks whether there exists a graph GS(V, ES), E1 ⊆ ES ⊆ E2, which has a homogeneous set. This paper presents an algorithm that uses the concept of bias graph [S. Tang, F. Yeh, Y. Wang, An efficient algorithm for solving the homogeneous set sandwich problem, Inform. Process. Lett. 77 (2001) 17-22] to solve the problem in O(n min{|E1|,|E2|} log n) time, thus outperforming the other known HSSP deterministic algorithms for inputs where max{|E1|, |E2|} = Ω (n log n).