Skip to main content
SpringerLink
Log in

Greedy posets for the bump-minimizing problem

  • Published:
Order Aims and scope Submit manuscript

Abstract

A bump (x i,x i+1) occurs in a linear extension L={x 1<...<xn} of a poset P, if x i<xi+1 in P. L. is greedy if x i<xj for every j>i, whenever (x i x i+1) in a bump in L. The purpose of this paper is to give a characterization of all greedy posets. These are the posets for which every greedy linear extension has a minimum number of bumps.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • F. Al-Thukair and N. Zaguia (1987), Greedy linear extensions for minimizing bumps in a poset, Order 4, 55–63.

    Google Scholar 

  • G. Chaty and M. Chein (1979) Ordered matchings and matchings without alternating cycles in bipartite graphs, Utilitas math. 16, 183–187.

    Google Scholar 

  • M. Chein and M. Habib (1984) Jump number of dags having Dilworth number 2, Disc. Appl. Math. 7, 243–250.

    Google Scholar 

  • O. Cogis and M. Habib (1979) Nombre de sauts et graphes série-parallèles, RAIRO Inform. Theor. 13, 3–18.

    Google Scholar 

  • C. Colbourn and W. Pulleyblank (1985) Minimizing setups in ordered sets of fixed width, Order 1, 225–228.

    Google Scholar 

  • D. Duffus, I. Rival, and P. Winkler (1982) Minimizing setups for cycle-free ordered sets, Proc. Amer. Math. Soc. 85, 509–513.

    Google Scholar 

  • M. H. El-Zahar and I. Rival (1985) Greedy linear extensions to minimize jumps, Disc. Appl. Math. 11, 143–156.

    Google Scholar 

  • M. H. El-Zahar and J. H. Schmerl (1984) On the size of jump-critical ordered sets, Order 1, 3–5.

    Google Scholar 

  • P. C. Fishburn and W. V. Gehrlein (1986) Minimizing bumps in linear extensions of ordered sets, Order 3, 3–14.

    Google Scholar 

  • G. Gierz and W. Poguntke (1983) Minimizing setups for ordered sets: a linear algebraic approach, SIAM J. Alg. Disc. Math. 4, 132–144.

    Google Scholar 

  • R. Möhring (1985) Algorithmic aspects of comparability graphs, in Graphs and Order (I. Rival ed.), D. Reidel, Dordrecht.

    Google Scholar 

  • W. R. Pulleyblank (1986) On minimizing setups in precedence constrained scheduling, to appear in Disc. Appl. Math.

  • I. Rival (1983) Optimal linear extensions by interchanging chains, Proc. Amer. Math. Soc. 89, 387–394.

    Google Scholar 

  • I. Rival (1984) Linear extensions of finite ordered sets, Ann. Disc. Math. 23, 355–370.

    Google Scholar 

  • I. Rival and N. Zaguia (1986) Constructing linear extensions by interchanging chains, Order 3, 107–121.

    Google Scholar 

  • I. Rival and N. Zaguia (1987), Greedy linear extensions with constraints, Disc. Math. 63, 249–260.

    Google Scholar 

  • G. Steiner (1985) On finding the jump number of a partial order by substitution decomposition, Order 2, 9–23.

    Google Scholar 

  • M. M. Syslo (1985) A graph theoretic approach to the jump number problem, in Graph and Order (I. Rival, ed.), D. Reidel, Dordrecht.

    Google Scholar 

  • M. Truszczynski (1985) Jump number problem: the role of matroids, Order 2, 1–8.

    Google Scholar 

  • N. Zaguia (1987) Minimizing bumps for posets of width two, to appear in Appl. Discrete Math.

Download references

Author information

Authors and Affiliations

  1. College of Science, Department of Mathematics, King Saud University, P.O. Box 2455, 11451, Riyadh, Saudi Arabia

    Nejib Zaguia

Authors
  1. Nejib Zaguia
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by P.C. Fishburn

This research (Math/1406/31) was supported by the Research Center, College of Science, King Saud University, Riyadh, Saudi Arabia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zaguia, N. Greedy posets for the bump-minimizing problem. Order 4, 257–267 (1987). https://doi.org/10.1007/BF00337888

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00337888

AMS subject classifications (1980)

Key words

Search

Navigation