Author:
Booth Kyle E. C.,O’Gorman Bryan,Marshall Jeffrey,Hadfield Stuart,Rieffel Eleanor
Publisher
Springer International Publishing
Reference39 articles.
1. Alt, H., Blum, N., Mehlhorn, K., Paul, M.: Computing a maximum cardinality matching in a bipartite graph in time $$O(n^{1.5}m \log n)$$. Inf. Process. Lett. 37(4), 237–240 (1991)
2. Lecture Notes in Computer Science;A Ambainis,2006
3. Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505–510 (2019)
4. Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)
5. Lecture Notes in Computer Science;A Berzina,2004
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献