Line Graph-Based Optimal Routing for DEXes

Autores

No registrado

Año

2025

Publicación

arXiv

Categoría

Token Economics & DeFi

Estado de cita

Verificado

Dominios

routingarbitrage/negative cyclesliquidity networks

Notas

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

Relevancia para ƒxyz

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