Analysis of Graphs by Connectivity Considerations
From MaRDI portal
Cites work
- A Method of Determining the Number of Vertices Contained in the SC Network Corresponding to a Given SC Transmission Function
- A New Method of Checking the Consistency of Precedence Matrices
- Applications of Graphs and Boolean Matrices to Computer Programming
- Some Historical and Intuitive Aspects of Graph Theory
Cited in
(11)- State structures in digital filter configurations. II: Reduced and minimal state structures
- A new method to test system diagnosability
- A graph-structural approach for the generalization of data management systems
- A graph model for scheduling processes in systems with parallel computations
- Enumeration of all minimum feedback edge sets in a directed graph
- ON THE STRUCTURE OF DIRECTED GRAPHS WITH APPLICATIONS: A Rapprochement with Systems Theory Part I
- ON THE STRUCTURE OF DIRECTED GRAPHS WITH APPLICATIONS: A Rapprochement with Systems Theory Part II
- Complexity and performance of a graph theory algorithm for cluster analysis†
- Applications of graph theory in computer systems
- Data mining of social networks represented as graphs
- Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs
This page was built for publication: Analysis of Graphs by Connectivity Considerations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5516083)
