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

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Tetsuro Ito Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan
Makoto Kizawa Department of Information and Computer Sciences, Osaka University, Toyonaka, Osaka 560, Japan
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 3 Issue 3, Sept. 1977
Pages 227-231
ACM New York, NY, USA
table of contents doi>10.1145/355744.355746
The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental Cycles Published by ACM 1977 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 16
· Downloads (cumulative): 274
· Citation Count: 2


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder