Result: Extended skew partition problem

Title:
Extended skew partition problem
Authors:
DANTAS, Simone, DE FIGUEIREDO, Celina M. H, GRAVIER, Sylvain, KLEIN, Sulamita
Source:
Creation and recreation: a tribute to the memory of Claude BergeDiscrete mathematics. 306(19-20):2438-2449
Publisher Information:
Amsterdam: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme, Algorithm, Algoritmo, Complexité calcul, Computational complexity, Complejidad computación, Sommet graphe, Vertex(graph), Vértice grafo, Structure donnée, Data structure, Estructura datos, Temps polynomial, Polynomial time, Tiempo polinomial, 2-SAT, Algorithme graphe, Graph algorithm, Partition ensemble, Partition gauche, Skew partition, Algorithms and data structures, Computational and structural complexity
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
COPPE, Universidade Federal do Rio de Janeiro, Brazil
Instituto de Matemática and COPPE, Universidade Federal do Rio de Janeiro, Brazil
CNRS, Laboratoire Leibniz, France
ISSN:
0012-365X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18229886
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.18229886
Database:
PASCAL Archive

Further Information

A skew partition as defined by Chvátal is a partition of the vertex set of a graph into four nonempty parts A1, A2, B1, B2 such that there are all possible edges between A1 and A2, and no edges between B1 and B2. We introduce the concept of (n1, n2)-extended skew partition which includes all partitioning problems into n1 + n2 nonempty parts A1,..., An1, B1,..., Bn2 such that there are all possible edges between the Ai parts, no edges between the Bj parts, i ∈ {1,..., n1}, j e {1,..., n2}, which generalizes the skew partition. We present a polynomial-time algorithm for testing whether a graph admits an (n 1, n2)-extended skew partition. As a tool to complete this task we also develop a generalized 2-SAT algorithm, which by itself may have application to other partition problems.