Funder
Department of Science and Technology
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference24 articles.
1. Domination in Convex Bipartite and Convex-Round Graphs;Bang-Jensen,1999
2. Set partitioning via inclusion-exclusion;Björklund;SIAM J. Comput.,2009
3. A. Brandstädt, D. Kratsch, On the restriction of some NP-complete graph problems to permutation graphs, in: L. Budach, ed., Proc. of the FCT ’85 Conf., Lecture Notes in Computer Science, vol. 199, 1985, pp. 53-62.
4. Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps;Chor,2004
5. A linear algorithm for the domination number of a tree;Cockayne;Inform. Process. Lett.,1975
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献