Title of article :
The polynomial dichotomy for three nonempty part sandwich problems
Author/Authors :
Teixeira، نويسنده , , Rafael B. and Dantas، نويسنده , , Simone and de Figueiredo، نويسنده , , Celina M.H.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Abstract :
We classify into polynomial time or NP-complete all three nonempty part sandwich problems. This solves the polynomial dichotomy for this class of problems.
Keywords :
graph algorithms , Structural characterization of graphs , computational complexity
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
