An efficient algorithm for solving the homogeneous set sandwich problem

DOI10.1016/S0020-0190(00)00145-9zbMath1003.68109OpenAlexW1990280038MaRDI QIDQ1607076

Fu-Long Yeh, Shyue-Ming Tang, Yue-Li Wang

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00145-9

zbMATH Keywords

homogeneous set sandwich problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Note on the homogeneous set sandwich problem ⋮ Can transitive orientation make sandwich problems easier? ⋮ The pair completion algorithm for the homogeneous set sandwich problem ⋮ Complexity issues for the sandwich homogeneous set problem ⋮ A note on finding all homogeneous set sandwiches

Cites Work

• The homogeneous set sandwich problem
• A semi-strong perfect graph theorem
• \(P_ 4\)-trees and substitution decomposition
• Modular decomposition and transitive orientation
• Parallel concepts in graph theory
• Normal hypergraphs and the perfect graph conjecture
• Incremental modular decomposition
• Graph Sandwich Problems
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: An efficient algorithm for solving the homogeneous set sandwich problem