Abstract
The purpose of this paper is to give an ‘effective’ characterization of all interval orders which are ‘greedy’ with respect to the ‘jump number’ problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. A.Kierstead (1986) NP-completeness results concerning greedy and super greedy linear extensions,Order 3, 123–134.
I.Rival (1983) Optimal linear extensions by interchanging chains,Proc. Amer. Math. Soc. 89, 387–394.
I.Rival and N.Zaguia (1986) Constructing greedy linear extensions by interchanging chains,Order 3, 107–121.
I.Rival and Z.Zaguia (1987) Greedy linear extensions with constraints,Discrete Math. 63, 249–260.
Author information
Authors and Affiliations
Additional information
Communicated by I. Rival
This research (Math/1406/30) was supported by the Research Center, College of Science, King Saud University, Riyadh, Saudi Arabia.
Rights and permissions
About this article
Cite this article
Ghazal, T., Sharary, A. & Zaguia, N. On minimizing the jump number for interval orders. Order 4, 341–350 (1988). https://doi.org/10.1007/BF00714476
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00714476