Finding all maximally-matchable edges in a bipartite graph

From MaRDI portal
Revision as of 03:46, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:418005

DOI10.1016/j.tcs.2011.12.071zbMath1241.05117arXiv1107.4711OpenAlexW1998124720WikidataQ56341084 ScholiaQ56341084MaRDI QIDQ418005

Tamir Tassa

Publication date: 14 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.4711




Related Items (9)



Cites Work


This page was built for publication: Finding all maximally-matchable edges in a bipartite graph