The polynomial dichotomy for three nonempty part sandwich problems

Authors:
Rafael B. Teixeira;Simone Dantas;Celina M. H. de Figueiredo
Affiliations:
COPPE, Universidade Federal do Rio de Janeiro, Brazil;Instituto de Matemática, Universidade Federal Fluminense, Brazil;COPPE, Universidade Federal do Rio de Janeiro, Brazil
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 11
Cited 1

Graph sandwich problems

Journal of Algorithms
The homogeneous set sandwich problem

Information Processing Letters
On stable cutsets in graphs

Discrete Applied Mathematics
Finding skew partitions efficiently

Journal of Algorithms
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
List Partitions

SIAM Journal on Discrete Mathematics
The list partition problem for graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Stable skew partition problem

Discrete Applied Mathematics
On decision and optimization (k, l)-graph sandwich problems

Discrete Applied Mathematics
The sandwich problem for cutsets: clique cutset, k-star cutset

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile

The P versus NP-complete dichotomy of some challenging problems in graph theory

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We classify into polynomial time or NP-complete all three nonempty part sandwich problems. This solves the polynomial dichotomy into polynomial time and NP-complete for this class of graph partition problems.