Applications of graph theory in computer systems

Cites Work

Title not available (Why is that?)
Depth-First Search and Linear Graph Algorithms
A Theorem on Boolean Matrices
Gaussian elimination is not optimal
Efficient determination of the transitive closure of a directed graph
Title not available (Why is that?)
Characterizations of Reducible Flow Graphs
Flow Graph Reducibility
Optimal Sequential Partitions of Graphs
Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
Enumeration of the Elementary Circuits of a Directed Graph
Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations
Analysis of Graphs by Connectivity Considerations
Title not available (Why is that?)
Rollback and Recovery Strategies for Computer Programs
A transitive closure algorithm
Fast algorithms for the elimination of common subexpressions
Title not available (Why is that?)
On the Boolean Matrix Equation M ^′ =ν _i=1 M ⁱ
A global flow analysis algorithm
An algorithm for computing all paths in a graph
Title not available (Why is that?)
Some Topics in Code Optimization
Title not available (Why is that?)
Optimization Strategies for Microprograms
Models of Computational Systems-Cyclic to Acyclic Graph Transformations
Experiments on Models of Computations and Systems
Path Length Computations on Graph Models of Computations
Automatic segmentation of cyclic program structures based on connectivity and processor timing
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
An efficient search algorithm to find the elementary circuits of a graph
The identification of parallel micro-operations
System Segmentation for the Parallel Diagnosis of Computers
Analysis of Graphs by Ordering of Nodes
System Modeling and Testing Procedures for Microdiagnostics
The application of graphs to the analysis of distribution of loops in a program
Legality and Other Properties of Graph Models of Computations
A review of directed graphs as applied to computors
Analysis of boolean program models for time-shared, paged environments
Bounds for Maxium Parallelism in a Bilogic Graph Model of Computations
Memory Requirements in a Multiprocessing Environment
Parallel Task Execution in a Decentralized System
Analysis of an Information System Model with Transfer Penalties

Cited In (3)

Vulnerability of dynamic systems†
Methods and means of parallel processing of information
On pure structure of dynamic systems

Uses Software

ALGOL 60

This page was built for publication: Applications of graph theory in computer systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079059)