<p>Given a bipartite graph with fixed nodes and incrementally arriving edges, is there any efficient algorithm to compute and update the maximum matching?</p>

CC BY-SA 3.0
2016-04-02T23:23:58.657Z
https://www.computer.org/csdl/proceedings/focs/2014/6517/00/6517a384.pdf
Neal Young
CC BY-SA 3.0
2016-04-03T02:30:51.697Z
This paper assumes the nodes on the left side are arriving. It is different problem setting from mine.
Chuancong Gao
CC BY-SA 3.0
2016-04-23T03:19:32.737Z
@Chuancong, I think you should update your questions explaining in it why the solution in the link Neal provided does answer yours. That way people can tailor their comments and answers to the question you really want an answer for.
Kaveh
<matching><dynamic-algorithms><bipartite-graphs>
Algorithm for maximum bipartite matching with arriving edges?
Chuancong Gao
# Algorithm for maximum bipartite matching with arriving edges?

(Asked by: username_0 on 2016-04-02)

Given a bipartite graph with fixed nodes and incrementally arriving edges, is there any efficient algorithm to compute and update the maximum matching?

**Tags:** matching, dynamic-algorithms, bipartite-graphs
> **Comments:**
> **username_1**: https://www.computer.org/csdl/proceedings/focs/2014/6517/00/6517a384.pdf  
> **username_0**: This paper assumes the nodes on the left side are arriving. It is different problem setting from mine.  
> **username_2**: @Chuancong, I think you should update your questions explaining in it why the solution in the link Neal provided does answer yours. That way people can tailor their comments and answers to the question you really want an answer for.  

---

## 0 answers

