Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Fast probabilistic algorithms for Hamiltonian circuits and matchings;Angluin;J. Comput. System Sci.,1979
2. Improved approximation algorithms for minimum-weight vertex separators;Feige,2005
3. Parameterized Complexity Theory;Flum,2006
4. Expander graphs and their applications;Hoory;Bull. Amer. Math. Soc.,2006
5. Can you beat treewidth?;Marx,2007
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献