For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
1
views
0
references
 Top references
cited by
25
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,066
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Article: not found

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

      Author(s): , ,
      Publication date (Print):
      Journal: Journal of the ACM
      Publisher: Association for Computing Machinery (ACM)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Author and article information

          Journal
          Title: Journal of the ACM
          Abbreviated Title: J. ACM
          Publisher: Association for Computing Machinery (ACM)
          ISSN (Print): 00045411
          Publication date (Print): July 1982
          Volume: 29
          Issue: 3
          Pages: 623-641
          Article
          DOI: 10.1145/322326.322328
          SO-VID: a7a9b598-5af0-4f05-841c-7d81d75bade8
          History

          Data availability:

          Comments

          Comment on this article

          scite_

          Similar content1,066

          See all similar

          Cited by25

          See all cited by