pith. sign in

Fully Dynamic Matching in Bipartite Graphs , booktitle =

Monika Henzinger, Sebastian Krinninger, Danupon N anongkai · 2015 · DOI 10.1007/978-3-662-47672-7

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

fields

cs.DS 2

years

2026 1 2019 1

verdicts

UNVERDICTED 2

representative citing papers

Dynamic Rank, Basis, and Matching

cs.DS · 2026-05-11 · unverdicted · novelty 8.0

The first dynamic algorithms for matrix rank and related objects achieve update times scaling with rank r, specifically Õ(r^1.405) per entry update and Õ(r^1.528 + z) per column update, extending to dynamic maximum matching.

citing papers explorer

Showing 2 of 2 citing papers.

  • Dynamic Rank, Basis, and Matching cs.DS · 2026-05-11 · unverdicted · none · ref 10

    The first dynamic algorithms for matrix rank and related objects achieve update times scaling with rank r, specifically Õ(r^1.405) per entry update and Õ(r^1.528 + z) per column update, extending to dynamic maximum matching.

  • Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs cs.DS · 2019-07-04 · unverdicted · none · ref 14

    First deterministic subquadratic partially-dynamic algorithm for approximate APSP in directed graphs using reliable hub sets.