Advertisement

Graphentheoretische Repräsentation endlicher Ordnungen

Conference paper
Part of the Proceedings in Operations Research book series (ORP, volume 1973)

Abstract

Partially ordered sets (with a real function) form a model for planning networks, which is independent of the representation by directed graphs (edge model or vertex model). The edge model generally requires the introduction of dummies, which means an extension of the ordered set. We look for smallest extensions under certain restrictions derived from the application of ordered sets as planning networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [1]
    Bruns, M. - Kaerkes, R. Zur Einbettung strikter Halbordnungen in Netzrelationen O.R. Verfahren, Band VII, 1969Google Scholar
  2. [2]
    Harary, F. - Nörman, R.Z. - Cartwright, D. Structural Models, Wiley & Son, New York, 1965Google Scholar
  3. [3]
    Kaerkes, R. Zum Begriff des orientierten Graphen, O.R. Verfahren, Band VII, 1969Google Scholar
  4. [4]
    Kaerkes, R. über das mathematische Netzplanmodell, O.R. Verfahren, Band XIV, 1972Google Scholar
  5. [5]
    Kaerkes, R. Netzplantheorie, Proceedings in O.R.3, Physica Verlag, 1973Google Scholar
  6. [6]
    Klefrm, U. Automatische Erstellung eines Netzplans aus der Reihenfolgetabelle und seine graphengesteuerte Auswertung nach CPM, EDV, 1966Google Scholar
  7. [7]
    Suchowizki, S.I. - Radtschik, I.A. Mathematische Methoden der Netzplantechnik, Teubner, 1969Google Scholar

Copyright information

© Physica-Verlag, Rudolf Liebing KG, Würzburg 1974

Authors and Affiliations

  1. 1.AachenDeutschland

Personalised recommendations