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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of the Brazilian Computer Society Ročník 20; číslo 1; s. 1
Hlavní autori:	Couto, Fernanda, Faria, Luerbio, Klein, Sulamita
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Springer London 01.12.2014 Sociedade Brasileira de Computação
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!