English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper we analyze the expected time complexity of the auctionalgorithm for the matching problem on random bipartite graphs. We prove thatthe expected time complexity of the auction algorithm for bipartite matching is$O\left(\frac{N\log^2(N)}{\log\left(Np\right)}\right)$ on sequential machines.This is equivalent to other augmenting path algorithms such as the HKalgorithm. Furthermore, we show that the algorithm can be implemented onparallel machines with $O(\log(N))$ processors and shared memory with anexpected time complexity of $O(N\log(N))$.

Expected time complexity of the auction algorithm and the push relabel algorithm for maximal bipartite matching on random graphs