Note on the homogeneous set sandwich problem

DOI10.1016/J.IPL.2004.09.022zbMATH Open1173.68844OpenAlexW2093293296MaRDI QIDQ834997FDOQ834997

Authors: Celina M. H. de Figueiredo, Vinícius G. P. 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

Recommendations

• A note on finding all homogeneous set sandwiches
• Algorithms for the homogeneous set sandwich problem
• The homogeneous set sandwich problem
• An efficient algorithm for solving the homogeneous set sandwich problem
• The pair completion algorithm for the homogeneous set sandwich problem

zbMATH Keywords

design of algorithmsperfect graphssandwich problemshomogeneous sets

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• The homogeneous set sandwich problem
• Complexity issues for the sandwich homogeneous set problem
• The pair completion algorithm for the homogeneous set sandwich problem
• Algorithms for the homogeneous set sandwich problem
• A note on finding all homogeneous set sandwiches
• An efficient algorithm for solving the homogeneous set sandwich problem

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

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