Search

A technique for using a digital computer to draw both ordinary and time-lag root locus diagrams is described. Ordinary diagrams are drawn much faster and more accurately than ever before. Time-lag diagrams, which had been impossible to obtain, are drawn with the same speed and accuracy as ordinary diagrams. [ABSTRACT FROM AUTHOR]

This article presents an algorithm related to an immediate predominators in a directed graph prepared by Paul W. Purdom and Edward F. Moore. The authors assume a directed graph whose nodes are labeled by integers between 1 and n. The arcs of this graph correspond to the flow of control between blocks of a computer program. The initial node of this graph is labeled by the integer 1. For optimizing the object code generated by a compiler, the relationship of immediate predominator has been used by scholars Edward S. Lowry and C.W. Medlock. It is said that the node/predominates node k if every path from node 1 to node k passes through node i. Node j is an immediate predominator of node k if node j predominates node k and if every other node i which predominates node k also predominates node j. The precise details of the list representation can be expressed in a more brief and unambiguous manner by a few lines of Algol than by an English description. The predominators of any given node can be computed as in an equation from the immediate predominators, and the articulation points of a graph are the predominators of the exit node.

The article discusses an algorithm an algorithm that generates a spanning tree with minimal total edge length. It is stated that the technique discussed was first suggested by Dijkstra. The article details the representation of the inter-node edge length array and the impact this connection will have on the generation of spanning forest containing the minimal spanning trees. Also discussed is the data storage required for the algorithm.

The article presents an algorithm for spanning tree (T). This procedure grows a spanning tree T for a given undirected loop-free graph G = (N, E) of v vertices and e edges. If G is disconnected a spanning forest will be grown. If neither of the vertices is included in a tree, the edge is taken as a new tree and its vertices numbered by an incremented component number c. Finally, if both vertices are in the same tree, the edge completes a fundamental cycle of the graph with respect to the spanning tree and consequently will not be considered further. The main loop in the procedure is executed e times.

Conflicts in scheduling can be treated as defining an undirected linear graph independently of the relation of the activities in conflict to additional constraints of time and space. Each connected component of such a graph, which can be found by on algorithm described by Gotlieb and Corneil, corresponds to a set of events that must be scheduled at different times. [ABSTRACT FROM AUTHOR]