Analysis of Graphs by Connectivity Considerations

Authors:
C. V. Ramamoorthy
Affiliations:
Honeywell, Inc., Waltham, Massachusetts
Venue:
Journal of the ACM (JACM)
Year:
1966

Citing 1
Cited 24

A New Method of Checking the Consistency of Precedence Matrices

Journal of the ACM (JACM)

Analysis of Graphs by Ordering of Nodes

Journal of the ACM (JACM)
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph

Journal of the ACM (JACM)
A Survey of Some Theoretical Aspects of Multiprocessing

ACM Computing Surveys (CSUR)
Automatic segmentation of cyclic program structures based on connectivity and processor timing

Communications of the ACM
Analysis of boolean program models for time-shared, paged environments

Communications of the ACM
The interconnection problem - a tutorial

DAC '73 Proceedings of the 10th Design Automation Workshop
A survey of compiler optimization techniques

ACM '73 Proceedings of the ACM annual conference
Recognition and representation of parallel processable streams in computer programs-II (Task/process Parallelism)

ACM '69 Proceedings of the 1969 24th national conference
A system for network picture processing with interactive computer graphics

ACM '69 Proceedings of the 1969 24th national conference
Testing large software with automated software evaluation systems

Proceedings of the international conference on Reliable software
The analytic design of a dynamic look ahead and program segmenting system for multiprogrammed computers

ACM '66 Proceedings of the 1966 21st national conference
Assessment Of Coupling And Cohesion For Component-Based Software By Using Shannon Languages

Journal of Integrated Design & Process Science
Dynamic Characteristics of Loops

IEEE Transactions on Computers
System Segmentation for the Parallel Diagnosis of Computers

IEEE Transactions on Computers
Program Suitability for Parallel Processing

IEEE Transactions on Computers
On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup

IEEE Transactions on Computers
A structural theory of machine diagnosis

AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
A survey of techniques for recognizing parallel processable streams in computer programs

AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
A methodology for the design and optimization of information processing systems

AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Automatic program segmentation based on Boolean connectivity

AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Automatic abstracting of textual material

IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
A new method to test system diagnosability

Information Sciences: an International Journal
DESIGN SPACE ANALYSIS IN MODEL-DRIVEN ENGINEERING

Journal of Integrated Design & Process Science
SYSTEM MODELING AND ANALYSIS USING COMMUNICATION CHANNELS

Journal of Integrated Design & Process Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

Discrete sequential systems, such as sampled data systems, discrete Markov processes, linear shift register generators, computer programs, sequential code generators, and prefixed comma-free codes, can be represented and studied in a uniform manner by directed graphs and their generating functions. In this paper the properties of the generating functions are examined from certain connectivity considerations of these graphs.