GenusSink delivers near-linear-time approximate generalized Sinkhorn algorithms for bounded-genus graphs via separator decompositions, computational geometry, and fast matrix-vector multiplies with generalized distance matrices.
Fast tree-field integrators: From low displacement rank to topological transformers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
GenusSink delivers near-linear-time approximate generalized Sinkhorn algorithms for bounded-genus graphs via separator decompositions, computational geometry, and fast matrix-vector multiplies with generalized distance matrices.