A note on finding all homogeneous set sandwiches

DOI10.1016/S0020-0190(03)00265-5zbMath1161.68671OpenAlexW2014029392MaRDI QIDQ1014412

Emmanuelle Lebhar, Christophe Paul, Michel A. Habib

Publication date: 28 April 2009

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(03)00265-5

zbMATH Keywords

analysis of algorithmshomogeneous setsandwich problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

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 ⋮ On the bi-enhancement of chordal-bipartite probe graphs

Cites Work

• The homogeneous set sandwich problem
• An efficient algorithm for solving the homogeneous set sandwich problem
• Normal hypergraphs and the perfect graph conjecture
• Graph Sandwich Problems

This page was built for publication: A note on finding all homogeneous set sandwiches