Marked directed graphs. (English) Zbl 0238.05109


05C20 Directed graphs (digraphs), tournaments
05C35 Extremal problems in graph theory
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
Full Text: DOI


[1] Petri, C.A., Kommunikation mit automaten, Schriften des rheinisch-westfalischen institutes für instrumentelle Mathematik an der universität Bonn, hft. 2, Bonn, (1962), Translated into English by Project ISTP: “Communication with Automata,” translated by Clifford F. Greene, Jr., a Supplement to Technical Documentary Report No. 1 prepared for Rome Air Development Center #AF 30 (602)-3344, 1965
[2] Holt, A.W., Information system theory project, Technical report for Rome air development center no. RADC-TR-68-305, prepared by applied data research, inc., Princeton, N. J., (1968), Available from the Department of Commerce Clearing House, Springfield, Virginia, as report No. AD 676-972
[3] Shapiro, R.M.; Saint, H., A new approach to optimization of sequencing decisions, (), Part 5 · Zbl 0224.68003
[4] Ford, L.R.; Fulkerson, D.R., ()
[5] {\scA. W. Holt and F. Commoner}, Marked graphs and linear programming, unpublished notes. · Zbl 0238.05109
[6] Holt, A.W.; Commoner, F., “events and conditions,” information systems theory project, Research report of applied data research, lakeside office park, wakefield, massachusetts 01880, (1970)
[7] Genrich, H.J., “einfache nicht-sequentielle prozesse,” gesellschaft für Mathematik und datenverarbeitung, birlinghoven, west Germany, (1970) · Zbl 0216.27402
[8] Karp, R.M.; Miller, R.E., Properties of a model for parallel computations: determinacy, terminations, queueing, SIAM J. appl. math., 14, 1300-1411, (1966) · Zbl 0149.12501
[9] Reiter, R., Scheduling parallel computations, Jacm, 14, 590-599, (1968) · Zbl 0167.16405
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.