Extended skew partition problem

A skew partition as defined by Chvátal is a partition of the vertex set of a graph into four nonempty parts A 1 , A 2 , B 1 , B 2 such that there are all possible edges between A 1 and A 2 , and no edges between B 1 and B 2 . We introduce the concept of ( n 1 , n 2 ) -extended skew partition which i...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics Ročník 306; číslo 19; s. 2438 - 2449
Hlavní autori:	Dantas, Simone, de Figueiredo, Celina M.H., Gravier, Sylvain, Klein, Sulamita
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 06.10.2006
Predmet:	2-SAT Algorithms and data structures Computational and structural complexity Skew partition Algorithms and data structures Skew partition Computational and structural complexity 2-SAT
ISSN:	0012-365X, 1872-681X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!