Computing an Evolutionary Ordering is Hard - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Discrete Mathematics Year : 2015

Computing an Evolutionary Ordering is Hard

Abstract

A family of sets is evolutionary if it is possible to order its elements such that each set except the first one has an element in the union of the previous sets and also an element not in that union. This definition is inspired by a conjecture of Naddef and Pulleyblank concerning ear decompositions of 1-extendable graphs. Here we consider the problem of determining whether a family of sets is evolutionary. We show that the problem is NP-complete even when every set in the family has at most 3 elements and each element appears at most a constant number of times. In contrast, for families of intervals of integers, we provide a polynomial time algorithm for the problem.
Fichier principal
Vignette du fichier
evolution-sets-Lagos.pdf (245.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01249259 , version 1 (30-12-2015)

Identifiers

Cite

Laurent Bulteau, Gustavo Sacomoto, Blerina Sinaimeri. Computing an Evolutionary Ordering is Hard. Electronic Notes in Discrete Mathematics, 2015, ⟨10.1016/j.endm.2015.07.043⟩. ⟨hal-01249259⟩
133 View
79 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More