On The Np-completeness Of Regular 2-d Fpga Routing Architectures And A Novel Solution
Author:
Yu-Liang Wu ,Chang D.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Deterministic Concurrent-Routing Algorithm to Improve Wire Selection in FPGA Routing;2024 9th International Conference on Integrated Circuits, Design, and Verification (ICDV);2024-06-06
2. Solving the FPGA Routing Problem Using the Model of an Extended Mixed Routing Graph;Russian Microelectronics;2023-12
3. Backpass Trees for Modifying PathFinder-based Routing Algorithm for FPGA;2022 IEEE International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON);2022-11-11