Author:
Banerjee Indranil,Richards Dana
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Alon, N., Chung, F.R., Graham, R.L.: Routing permutations on graphs via matchings. SIAM J. Discrete Math. 7(3), 513–530 (1994)
2. Gyárfás, A., Ruszinkó, M., Sárközy, G., Szemerédi, E.: Partitioning 3-colored complete graphs into three monochromatic cycles. Electronic J. Comb. 18, 1–16 (2011)
3. Feige, U., Goldwasser, S., Lovász, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. J. ACM (JACM) 43(2), 268–292 (1996)
4. Lecture Notes in Computer Science;J Kawahara,2017
5. Zhang, L.: Optimal bounds for matching routing on trees. SIAM J. Discrete Math. 12(1), 64–77 (1999)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mitigating CNOT Errors via Noise-aware Token Swapping;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17
2. Noise-aware Token Swapping for Qubit Routing;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17
3. Advantages and Limitations of Quantum Routing;PRX Quantum;2023-02-01
4. Surface Code Compilation via Edge-Disjoint Paths;PRX Quantum;2022-05-25
5. Locality-aware Qubit Routing for the Grid Architecture;2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2022-05