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

DOI10.1016/j.tcs.2013.03.015zbMath1278.05191OpenAlexW2065389185MaRDI QIDQ387819

Tamir Tassa

Publication date: 17 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.03.015

zbMATH Keywords

bipartite graphsperfect matchingsmaximally-matchable edgesmaximum matchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Finding all maximally-matchable edges in a bipartite graph
• Unnamed Item

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