Applications of graph theory in computer systems
From MaRDI portal
Publication:4079059
DOI10.1007/BF00991069zbMath0317.68041OpenAlexW2061360170MaRDI QIDQ4079059
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
Formal languages and automata (68Q45) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)
Related Items
Methods and means of parallel processing of information, On pure structure of dynamic systems, Vulnerability of dynamic systems†
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The identification of parallel micro-operations
- Fast algorithms for the elimination of common subexpressions
- Gaussian elimination is not optimal
- Efficient determination of the transitive closure of a directed graph
- Characterizations of Reducible Flow Graphs
- Some Topics in Code Optimization
- A review of directed graphs as applied to computors
- Enumeration of the Elementary Circuits of a Directed Graph
- The application of graphs to the analysis of distribution of loops in a program
- Analysis of Graphs by Connectivity Considerations
- On the Boolean Matrix Equation M ′ =ν i=1 M i
- An algorithm for computing all paths in a graph
- Models of Computational Systems-Cyclic to Acyclic Graph Transformations
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Experiments on Models of Computations and Systems
- Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations
- Analysis of boolean program models for time-shared, paged environments
- Path Length Computations on Graph Models of Computations
- Bounds for Maxium Parallelism in a Bilogic Graph Model of Computations
- Automatic segmentation of cyclic program structures based on connectivity and processor timing
- A transitive closure algorithm
- Legality and Other Properties of Graph Models of Computations
- Optimal Sequential Partitions of Graphs
- Optimization Strategies for Microprograms
- System Segmentation for the Parallel Diagnosis of Computers
- An efficient search algorithm to find the elementary circuits of a graph
- Memory Requirements in a Multiprocessing Environment
- A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
- Analysis of Graphs by Ordering of Nodes
- Rollback and Recovery Strategies for Computer Programs
- System Modeling and Testing Procedures for Microdiagnostics
- Parallel Task Execution in a Decentralized System
- Depth-First Search and Linear Graph Algorithms
- Analysis of an Information System Model with Transfer Penalties
- A global flow analysis algorithm
- Flow Graph Reducibility
- A Theorem on Boolean Matrices
