Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Affiliation:
1
0
0
0
A linear bound ($641\ell$) is proven for graph connectivity partitioning, resolving a long-standing open problem and improving upon a previous quadratic bound.