Title of article :
The Graph Sandwich Problem for -sparse graphs
Author/Authors :
Dantas، نويسنده , , Simone and Klein، نويسنده , , Sulamita and de Mello، نويسنده , , Célia P. and Morgana، نويسنده , , Aurora، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Abstract :
The P 4 -sparse Graph Sandwich Problem asks, given two graphs G 1 = ( V , E 1 ) and G 2 = ( V , E 2 ) , whether there exists a graph G = ( V , E ) such that E 1 ⊆ E ⊆ E 2 and G is P 4 -sparse. In this paper we present a polynomial-time algorithm for solving the Graph Sandwich Problem for P 4 -sparse graphs.
Keywords :
P 4 -sparse graphs , computational complexity , Graph sandwich problems , Partition problems , Algorithms , Cographs
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
