"Addendum to "Finding all maximally-matchable edges in a bipartite graph" ..."

Tamir Tassa (2013)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2013.03.015

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Tassa13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Tassa13
Tamir Tassa:
Addendum to "Finding all maximally-matchable edges in a bipartite graph" [Theoret. Comput. Sci. 423 (2012) 50-58]. Theor. Comput. Sci. 491: 136 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.