The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental Cycles

Authors:
Tetsuro Ito;Makoto Kizawa
Affiliations:
Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan;Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1977

Citing 3
Cited 2

Basic cycle generation [H]

Communications of the ACM
An algorithm for finding a fundamental set of cycles of a graph

Communications of the ACM
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

Hierarchical file organization and its application to similar-string matching

ACM Transactions on Database Systems (TODS)
Algorithms for Generating Fundamental Cycles in a Graph

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	0.00

Visualization

Abstract