Journal of Algorithms
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
SIAM Journal on Computing
The homogeneous set sandwich problem
Information Processing Letters
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The graph sandwich problem for 1-join composition is NP-complete
Discrete Applied Mathematics
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Complexity of (k, l)-Graph Sandwich Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On decision and optimization (k, l)-graph sandwich problems
Discrete Applied Mathematics
The polynomial dichotomy for three nonempty part sandwich problems
Discrete Applied Mathematics
The external constraint 4 nonempty part sandwich problem
Discrete Applied Mathematics
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
| Hi-index | 0.00 |
Sandwich problems generalize graph recognition problems with respect to a property Π. A recognition problem has a graph as input, whereas a sandwich problem has two graphs as input. In a sandwich problem, we look for a third graph, whose edge set lies between the edge sets of two given graphs. This third graph is required to satisfy a property Π. We present sandwich results corresponding to the polynomial recognition problems: clique cutset, star cutset, and a generalization k-star cutset. We note these graph cutset problems are of interest with respect to sandwich problems. We propose an O(n3)-time polynomial algorithm for star cutset sandwich problem, and an O(n2+k)-time polynomial algorithm for the k-star cutset sandwich problem. We propose an NP-completeness transformation from 1-in-3 3SAT (without negative literals) to clique cutset sandwich problem.