Title of article
The P4-sparse Graph Sandwich Problem
Author/Authors
Dantas، نويسنده , , S. A. Klein، نويسنده , , S. and de Mello، نويسنده , , C.P. and Morgana، نويسنده , , A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
4
From page
185
To page
188
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
Graph sandwich problems , Algorithms , computational complexity
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454122
Link To Document