Line Graph-Based Optimal Routing for DEXes
- Authors
- Various Authors
- Year
- 2025
- Venue
- arXiv
- Category
- Token Economics & DeFi
- 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