Line Graph-Based Optimal Routing for DEXes

Autoren

Nicht erfasst

Jahr

2025

Publikationsort

arXiv

Kategorie

Token Economics & DeFi

Zitierstatus

Verifiziert

Bereiche

routingarbitrage/negative cyclesliquidity networks

Anmerkungen

Line-graph transform (edges→vertices) finds the optimal token→token path in a CPMM DEX with finite termination even under arbitrage loops; outperforms the DFS routers used by Uniswap/Pancake on a large fraction of pairs

Relevanz für ƒxyz

The headline routing paper. Implemented as `buildLineGraph` (L449) + `findOptimalRouteViaLineGraph` (L683) in `routing-engine.ts`, UI-toggleable