Funder
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro
Fundacao Cearense de Apoio ao Desenvolvimento Cientifico e Tecnologico
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference119 articles.
1. Complexity of maximum cut on interval graphs;Adhikary,2020
2. NP-completeness of the Hamiltonian cycle problem for bipartite graphs;Akiyama;J. Inf. Process.,1980
3. Linear time algorithms for finding a dominating set of fixed size in degenerated graphs;Alon;Algorithmica,2009
4. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
5. Linear time algorithms for NP-hard problems restricted to partial k-trees;Arnborg;Discrete Appl. Math.,1989
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献