Note on the homogeneous set sandwich problem

DOI10.1016/j.ipl.2004.09.022zbMath1173.68844OpenAlexW2093293296MaRDI QIDQ834997

Celina M. Herrera de Figueiredo, Vinícius G. Pereira de Sá

Publication date: 27 August 2009

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.022

zbMATH Keywords

design of algorithmsperfect graphssandwich problemshomogeneous sets

Mathematics Subject Classification ID

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

Related Items (2)

The pair completion algorithm for the homogeneous set sandwich problem ⋮ Complexity issues for the sandwich homogeneous set problem

Cites Work

• The homogeneous set sandwich problem
• A semi-strong perfect graph theorem
• \(P_ 4\)-trees and substitution decomposition
• Modular decomposition and transitive orientation
• An efficient algorithm for solving the homogeneous set sandwich problem
• Incremental modular decomposition
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item

This page was built for publication: Note on the homogeneous set sandwich problem