The homogeneous set sandwich problem

DOI10.1016/S0020-0190(98)00076-3zbMATH Open1339.05382MaRDI QIDQ293307FDOQ293307

Authors: Márcia R. Cerioli, Hazel Everett, Sulamita Klein, Celina M. H. de Figueiredo 

Publication date: 9 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000763?np=y

Recommendations

• Note on the homogeneous set sandwich problem
• Algorithms for the homogeneous set sandwich problem
• A note on finding all homogeneous set sandwiches
• Complexity issues for the sandwich homogeneous set problem
• An efficient algorithm for solving the homogeneous set sandwich problem
• The pair completion algorithm for the homogeneous set sandwich problem
• The sandwich problem for decompositions and almost monotone properties
• The chain graph sandwich problem
• Bounded degree interval sandwich problems
• Sandwich classification theorem

zbMATH Keywords

design of algorithmsperfect graphssandwich problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Normal hypergraphs and the perfect graph conjecture
• Graph Sandwich Problems
• Total chromatic number of unichord-free graphs
• Title not available (Why is that?)
• A semi-strong perfect graph theorem
• \(P_ 4\)-trees and substitution decomposition
• Comparability graphs and a new matroid
• Recognizing bull-free perfect graphs
• Compositions for perfect graphs
• Incremental modular decomposition
• Computing the Minimum Fill-In is NP-Complete

Cited In (25)

• Can transitive orientation make sandwich problems easier?
• The P4-sparse Graph Sandwich Problem
• Title not available (Why is that?)
• The polynomial dichotomy for three nonempty part sandwich problems
• The graph sandwich problem for \(P_4\)-sparse graphs
• Matrix sandwich problems
• Title not available (Why is that?)
• The graph sandwich problem for 1-join composition is NP-complete
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• On decision and optimization (\(k\),\(l\))-graph sandwich problems
• Complexity issues for the sandwich homogeneous set problem
• The external constraint 4 nonempty part sandwich problem
• Note on the homogeneous set sandwich 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
• Competitive graph searches
• The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
• Skew partition sandwich problem is NP-complete
• An efficient algorithm for solving the homogeneous set sandwich problem
• The sandwich problem for decompositions and almost monotone properties
• Sandwiches missing two ingredients of order four
• On the forbidden induced subgraph sandwich problem
• The polynomial dichotomy for three nonempty part sandwich problems
• On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

This page was built for publication: The homogeneous set sandwich problem

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