Cyclic extensions of order varieties


International audienceWe 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

Similar works

Full text



Full text is not available
oaioai:HAL:hal-00692088v1Last time updated on 11/11/2016

This paper was published in HAL AMU.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.