arXiv (All)
open access
Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
We present GenusSink, a new class of approximate generalized Sinkhorn algorithms with shortest-path-distance costs for bounded genus (e.g. planar) graphs, providing near-linear time: (1) pre-processing, (2) iteration step, (3) final transport plan matrix querying and near-linear memory. Graphs handl
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bidirectional Dijkstra's Algorithm is Instance-Optimal#1014476
- Systematic vertex corrections through iterative solution of Hedin's equations beyond the it GW approximation#290349
- Using median sets for inferring phylogenetic trees#622742
- The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems#1083223
- Maximum likelihood estimation of phylogenetic branch lengths for a star-like phylogeny#250717
Record · ID 1118559
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive