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.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01249259
Contributor : Marie-France Sagot <>
Submitted on : Wednesday, December 30, 2015 - 9:34:24 PM
Last modification on : Thursday, June 6, 2019 - 1:34:53 PM
Long-term archiving on : Friday, April 1, 2016 - 12:57:44 AM

File

evolution-sets-Lagos.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

318

Files downloads

161