Complexity Issues of Variants of Secure Domination in Graphs.
Devendra LadP. Venkata Subba ReddyJakkepalli Pavan KumarPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- security issues
- computational issues
- worst case
- key issues
- computational cost
- graph matching
- access control
- lightweight
- graph partitioning
- graph theoretic
- graph theory
- polynomial time complexity
- identity management
- graph construction
- graph clustering
- key management
- spanning tree
- data sets
- wireless sensor networks
- computational complexity
- social networks