Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
