Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference45 articles.
1. Complexity of domination-type problems in graphs;Arne Telle;Nordic J. Comput.,1994
2. Nonserial Dynamic Programming;Bertelè,1972
3. Bounds on isoperimetric values of trees;Bharadwaj;Discrete Math.,2009
4. Restrictions of graph partition problems. Part I;Bodlaender;Theoret. Comput. Sci.,1995
5. Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem;Bonomo;Theoret. Comput. Sci.,2011
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献