The homogeneous set sandwich problem
From MaRDI portal
Publication:293307
DOI10.1016/S0020-0190(98)00076-3zbMATH Open1339.05382MaRDI QIDQ293307FDOQ293307
MΓ‘rcia R. Cerioli, Celina M. H. de Figueiredo, Hazel Everett, Sulamita Klein
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
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Normal hypergraphs and the perfect graph conjecture
- Graph Sandwich Problems
- Total chromatic number of unichord-free graphs
- 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 (24)
- 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
- 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
Recommendations
- Bounded degree interval sandwich problems π π
- A note on finding all homogeneous set sandwiches π π
- An efficient algorithm for solving the homogeneous set sandwich problem π π
- The sandwich problem for decompositions and almost monotone properties π π
- Complexity issues for the sandwich homogeneous set problem π π
- The chain graph 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 π π
- Title not available (Why is that?) π π
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)