Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference51 articles.
1. Adler I, Dorn F, Fomin FV, Sau I, Thilikos DM (2011) Faster parameterized algorithms for minor containment. Theor Comput Sci 412(50):7018–7028
2. Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47–97. https://doi.org/10.1103/RevModPhys.74.47
3. Aramon M, Rosenberg G, Valiante E, Miyazawa T, Tamura H, Katzgraber HG (2018) Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. arXiv:1806.08815
4. Bernal DE, Booth KEC, Dridi R, Alghassi H, Tayur S, Venturelli D (2020) Integer programming techniques for minor-embedding in quantum annealers. In: Hebrard E, Musliu N (eds) Integration of constraint programming, artificial intelligence, and operations research. Springer, Cham, pp 112–129
5. Bodlaender HL, Grigoriev A, Koster AMCA (2008) Treewidth lower bounds with brambles. Algorithmica 51:81–98. https://doi.org/10.1007/s00453-007-9056-z
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献