Line Graph-Based Optimal Routing for DEXes

Authors

Not recorded

Year

2025

Venue

arXiv

Category

Token Economics & DeFi

Cite status

Verified

Domains

routingarbitrage/negative cyclesliquidity networks

Notes

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

Relevance to ƒxyz

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