Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference20 articles.
1. NP-completeness of the hamiltonian cycle problem for bipartite graphs;Akiyama;J. Inf. Process.,1980
2. The Vapnik-Chervonenkis dimension of a random graph;Anthony;Discrete Math.,1995
3. Computational Complexity — A Modern Approach;Arora,2009
4. The monadic second-order logic of graphs. i. recognizable sets of finite graphs;Courcelle;Inf. Comput.,1990
5. Linear time solvable optimization problems on graphs of bounded clique-width;Courcelle;Theory Comput. Syst.,2000
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献