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

      Linear-time computation of optimal subgraphs of decomposable graphs

      Author(s): , ,
      Publication date Created:
      Publication date (Print):
      Journal: Journal of Algorithms
      Publisher: Elsevier BV

      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

          Most cited references13

          • Record: found
          • Abstract: not found
          • Article: not found

          The Recognition of Series Parallel Digraphs

          Jacobo Valdes, Robert Tarjan, Eugene L. Lawler (1982)
          Article 0 comments Cited 55 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Graph-theoretic parameters concerning domination, independence, and irredundance

            B. Bollobás, E. Cockayne (1980)
            Article 0 comments Cited 39 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

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

              T. Nishizeki, K Takamizawa, N Saito (1982)
              Article 0 comments Cited 25 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and article information

                Journal
                Title: Journal of Algorithms
                Abbreviated Title: Journal of Algorithms
                Publisher: Elsevier BV
                ISSN (Print): 01966774
                Publication date Created: June 1987
                Publication date (Print): June 1987
                Volume: 8
                Issue: 2
                Pages: 216-235
                Article
                DOI: 10.1016/0196-6774(87)90039-3
                SO-VID: d352311f-d57c-4457-a7e9-dfe5917c720a
                Copyright © © 1987
                License:

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Data availability:

                Comments

                Comment on this article

                scite_

                Similar content2,820

                See all similar

                Cited by25

                See all cited by

                Most referenced authors67

                See all reference authors