 |
|
|
|
| HAL: lirmm-00512753, version 1 |
| Detailed view |  Export this paper |
|
|
| European Journal of Combinatorics 31 (2010) 681-687 |
|
|
|
|
| Partitions Versus Sets : A Case of Duality |
|
|
| Laurent Lyaudet 1Frédéric Mazoit 2 |
|
|
| (2010) |
|
|
|
| In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-hoc proofs in one duality theorem based on submodular partition functions. This general theorem remains however a bit technical and relies on this particular submodularity property. Instead of partition functions, we propose here a simple combinatorial property of set of partitions which also gives these duality results. Our approach is both simpler, and a little bit more general. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
| 2: | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux – Université Victor Segalen - Bordeaux II |
|
|
| 3: | Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) |
|
|
|
CNRS : UMR5506 – Université Montpellier II - Sciences et Techniques du Languedoc |
|
|
|
|
|
|
|
|
|
| [INFO/ALGCO] |
|
|
|
|
| Subject | : | Computer Science/Discrete Mathematics |
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| lirmm-00512753, version 1 | |
| http://hal-lirmm.ccsd.cnrs.fr/lirmm-00512753 | |
| oai:hal-lirmm.ccsd.cnrs.fr:lirmm-00512753 | |
| From: Stephan Thomasse | |
| Submitted on: Tuesday, 31 August 2010 15:08:14 | |
| Updated on: Wednesday, 1 September 2010 10:32:36 | |
