Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems

Background In this work, we consider the graph sandwich decision problem for property Π , introduced by Golumbic, Kaplan and Shamir: given two graphs G 1 =( V , E 1 ) and G 2 =( V , E 2 ), the question is to know whether there exists a graph G =( V , E ) such that E 1 ⊆ E ⊆ E 2 and G satisfies prope...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the Brazilian Computer Society Jg. 20; H. 1; S. 1
Hauptverfasser:	Couto, Fernanda, Faria, Luerbio, Klein, Sulamita
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Springer London 01.12.2014 Sociedade Brasileira de Computação
Schlagworte:	Computer Science Computer System Implementation Data Structures Graph theory and algorithms: fifth Latin-American workshop on cliques in graphs Operating Systems Simulation and Modeling Chordal-(k,l)graph Graph sandwich problem Strongly chordal-(k,l)graph
ISSN:	0104-6500, 1678-4804
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!