Online bipartite matching in offline time
By Anna Zych In 1973 Hopcroft and Karp gave a very nice time algorithm computing a maximum matching in unweighted bipartite graphs. This algorithm turned
Homepage » Archiwum dla October 19, 2014
By Anna Zych In 1973 Hopcroft and Karp gave a very nice time algorithm computing a maximum matching in unweighted bipartite graphs. This algorithm turned
You can use the anonymous submission form to upload information about an event, a blog post or a job posting. It will be published when it is approved by the moderator.