Cyclic extensions of order varieties - Archive ouverte HAL Access content directly
Journal Articles Electronic Notes in Theoretical Computer Science Year : 2008

Cyclic extensions of order varieties

Abstract

We study complexity problems involving three sorts of combinational structures: cyclic orders, order varieties and cycles. It is known that the problem of telling whether a cyclic order is included in some cycle is NP-complete. We show that the same question for order varieties, a special class of cyclic orders, is in L. For this, we relate the entropy relation between partial orders to the forcing relation of graph theory.
Fichier principal
Vignette du fichier
vocomplex7.pdf (214.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00692088 , version 1 (27-04-2012)

Identifiers

Cite

Pierre Ille, Paul Ruet. Cyclic extensions of order varieties. Electronic Notes in Theoretical Computer Science, 2008, 212, pp.119-132. ⟨10.1016/j.entcs.2008.04.057⟩. ⟨hal-00692088⟩
206 View
87 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More