A Simple Deterministic Algorithm for Edge Connectivity

08/19/2020 ∙ by Thatchaphol Saranurak, et al. ∙ 0

We show a deterministic algorithm for computing edge connectivity of a simple graph with m edges in m^1+o(1) time. Although the fastest deterministic algorithm by Henzinger, Rao, and Wang [SODA'17] has a faster running time of O(mlog^2mloglog m), we believe that our algorithm is conceptually simpler. The key tool for this simplication is the expander decomposition. We exploit it in a very straightforward way compared to how it has been previously used in the literature.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.