Skip to main content
SpringerLink
Log in

Minimum decomposition of partially ordered sets into chains

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Summary

A recursion formula is given for determining a minimum decomposition of a partially ordered set into chains.

Zusammenfassung

Ein Rekursionverfahren für die minimale Zerlegung von einer teilweise geordneten Menge in die Ketten wird angegeben.

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

  • Dilworth, R. P.: A Decomposition Theorem for Partially Ordered Sets, in: Ann. of Math.51, 161–166, 1950.

    Google Scholar 

  • Fulkerson, D. R.: Scheduling in Project Networks, RAND Corp. Memo., RM-4137-PR, 1964.

  • Hakimi, S. L., andH. Frank: Maximum Internally Stable Sets of a Graph, in: J. Math. Anal. Appl.25, 296–308, 1969.

    Article  Google Scholar 

  • Hammer, P. L., andS. Rudeanu: Boolean Methods in Operations Research and Related Areas, Berlin-Heidelberg-New York (Springer-Verlag), 1968.

    Google Scholar 

  • Mirsky, L.: A Dual of Dilworth's Decomposition Theorem, in: Amer. Math. Monthly78, 876–877, 1971.

    Google Scholar 

  • Nieminen, L.: On Maximum Internally Stable Sets of Graphs, to appear in: Naval Res. Log. Quarterly.

  • Starobinets, S. M.: On an Algorithm for Finding the Greatest Internally Stable Set of a Graph, in: Eng. Cybernetics,10, 873–877. (In Russian: Izv. Akad. Nauk SSSR Tehn. Kib.,5, 135–140), 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Technical Sciences, Finnish Academy, Lauttasaarentie 1, 00200, Helsinki 20, Finland

    J. Nieminen (Research assistant)

Authors
  1. J. Nieminen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nieminen, J. Minimum decomposition of partially ordered sets into chains. Zeitschrift für Operations Research 19, 63–67 (1975). https://doi.org/10.1007/BF01958601

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation