Linear-time computability of combinatorial problems on series-parallel graphs

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: K. Takamizawa C & C Laboratories, Nippon Electric Co Ltd, Kawasaki, Japan 213
T. Nishizeki Department of Electrical Communications, Tohoku University, Sendai, Japan 980
N. Saito Department of Electrical Communications, Tohoku University, Sendai, Japan 980
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 29 Issue 3, July 1982
Pages 623-641
ACM New York, NY, USA
table of contents doi>10.1145/322326.322328
Linear-time computability of combinatorial problems on series-parallel graphs Published by ACM 1982 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 82
· Downloads (cumulative): 949
· Citation Count: 39


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