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

      Addendum to “Finding all maximally-matchable edges in a bipartite graph” [Theoret. Comput. Sci. 423 (2012) 50–58]

      Author(s):
      Publication date Created:
      Publication date (Print):
      Journal: Theoretical Computer Science
      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

          Author and article information

          Journal
          Title: Theoretical Computer Science
          Abbreviated Title: Theoretical Computer Science
          Publisher: Elsevier BV
          ISSN (Print): 03043975
          Publication date Created: June 2013
          Publication date (Print): June 2013
          Volume: 491
          Page: 136
          Article
          DOI: 10.1016/j.tcs.2013.03.015
          SO-VID: c8f53c84-e4c2-4c05-8678-b7ff9b15ae93
          Copyright © © 2013
          License:

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

          https://www.elsevier.com/open-access/userlicense/1.0/

          History

          Data availability:

          Comments

          Comment on this article