Has anyone coded of the algorithm given by Tassa, Tamir. "Finding all maximally-matchable edges in a bipartite graph." Theoretical Computer Science 423 (2012): 50-58 in Sage ?
Asked
Active
Viewed 72 times
1
-
Please, could you provide a link to (a preliminary version of) this paper? Or explain briefly how this algorithm works? – Taroccoesbrocco May 13 '18 at 02:13
-
https://www.sciencedirect.com/science/article/pii/S0304397511010474 – Rupesh Kasture May 13 '18 at 03:25
-
Above is the link of the paper. Problem is: In a bipartite graph (V1,V2,E) where |V1| is not equal to |V2|, I need to find the edges which not common in any maximum matching. @Taroccoesbrocco – Rupesh Kasture May 13 '18 at 03:30
-
Thanks for your time @Taroccoesbrocco I got a different approach to solve my problem still it would be helpful if you can code Algorithm 3 of the above mentioned paper. – Rupesh Kasture May 13 '18 at 03:55