Applications of graph theory in computer systems

DOI10.1007/BF00991069MaRDI QIDQ4079059zbMATHOpenAlexFDO

Authors William S. Bowie

Publication date 1976

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00991069

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)

Cites work

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

Cited in

(3)

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

Describes a project that uses

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)