Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: The Graph Sandwich Problem For P4-sparse Graphs
Author: Dantas S.
Klein S.
de Mello C.P.
Morgana A.
Abstract: The P4-sparse Graph Sandwich Problem asks, given two graphs G1 = (V, E1) and G2 = (V, E2), whether there exists a graph G = (V, E) such that E1 ⊆ E ⊆ E2 and G is P4-sparse. In this paper we present a polynomial-time algorithm for solving the Graph Sandwich Problem for P4-sparse graphs. © 2008 Elsevier B.V. All rights reserved.
Rights: fechado
Identifier DOI: 10.1016/j.disc.2008.01.014
Date Issue: 2009
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
2-s2.0-67349134537.pdf532.41 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.