On computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions
Abstract: Highlights•We relate our curvature computation problem to minimum weight perfect matching problem via fine-grained reduction.•We formalize the curvature computation problems so that they can be studied by researchers in local algorithms.•We provide first known query bounds for query-based algorithms for curvature computations in local algorithms framework.•We illustrate a localized version of fine-grained reductions.
Loading