SIGN IN
SIGN UP
Algorithms for Generating Fundamental Cycles in a Graph
Full Text:
PDF
Buy this Article
Authors:
Narsingh Deo
Computer Science Department, Washington State University, Pullman, WA
G. Prabhu
Computer Science Department, Washington State University, Pullman, WA
M. S. Krishnamoorthy
Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 8 Issue 1, March 1982
Pages 26-42
ACM
New York, NY
, USA
table of contents
doi>
10.1145/355984.355988
1982 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 59
· Downloads (cumulative): 1,306
· Citation Count: 16
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
reducibility and completeness
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder