Author:
Goodrich Timothy D.,Sullivan Blair D.,Humble Travis S.
Funder
Gordon and Betty Moore Foundation
National Defense Science and Engineering Fellowship
North Carolina Space Grant
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modelling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference39 articles.
1. Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: $$O(\sqrt{\log {n}})$$ O ( log n ) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. In: Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, pp. 573–581. ACM (2005)
2. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47 (2002)
3. Batagelj, V., Zaversnik, M.: An $$O(m)$$ O ( m ) algorithm for cores decomposition of networks. arXiv preprint cs/0310049 (2003)
4. Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069–1072 (1990)
5. Boothby, T., King, A.D., Roy, A.: Fast clique minor generation in Chimera qubit connectivity graphs. Quantum Inf. Process. 15(1), 495–508 (2016)
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献