Sign in
Back
On a setup optimization problem for interval orders
Journal article   Peer reviewed

On a setup optimization problem for interval orders

Ahmad Sharary and Nejib Zaguia
Information processing letters, Vol.44(1), pp.51-55
09/11/1992
DOI: https://doi.org/10.1016/0020-0190(92)90255-T

Abstract

Combinatorial problems interval orders jump number linear extension maximum clique
We prove that the jump number problem for interval orders is reducible to the maximum clique problem in a certain class of graphs. As applications, we solve the jump number problem for the interval orders with no special cycles, and we give an approximation for the number of jumps of any interval order.

Metrics

1 Record Views

Details