Funder
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Fundação de Amparo à Pesquisa do Estado de São Paulo (BR)
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference58 articles.
1. Amiri SA, de Mendez PO, Rabinovich R, Siebertz S (2017) Distributed domination on graph classes of bounded expansion. ArXiv pre-prints arXiv:1702.02848
2. Arvind K, Regan CP (1992) Connected domination and Steiner set on weighted permutation graphs. Inf Process Lett 41(4):215–220
3. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (1999) Complexity and approximation. Springer, Berlin
4. Berry A, Bordat J, Cogis O (1999) Generating all the minimal separators of a graph. Proceedings of the 25th international workshop on graph-theoretic concepts in computer science. Springer, Berlin, pp 167–172
5. Blum J, Ding M, Thaeler A, Cheng X (2005) Connected dominating set in sensor networks and MANETs. In: Du D, Pardalos PM (eds) Handbook of combinatorial optimization. Springer, Berlin, pp 329–369
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献